External Links

    Journal: Optimization Methods and Software

    Volume 37, Issue 6

    1979 -- 2000Nicolas Boutet, Joris Degroote, Rob Haelterman. A symmetric grouped and ordered multi-secant Quasi-Newton update formula
    2001 -- 2020Daniel Brosch, Etienne de Klerk. Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
    2021 -- 2051M. Marques Alves. Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods
    2052 -- 2079Puya Latafat, Panagiotis Patrinos. Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
    2080 -- 2116Kai Hoppmann-Baum, Oleg Burdakov, Gioni Mexi, Carl Johan Casselgren, Thorsten Koch. Length-constrained cycle partition with an application to UAV routing
    2117 -- 2134M. Sayadi Shahraki, H. Mansouri, Ali Delavarkhalafi. A wide neighbourhood predictor-corrector infeasible-interior-point algorithm for symmetric cone programming
    2135 -- 2156Roberto Andreani, Ana Luísa Custódio, Marcos Raydan. Using first-order information in direct multisearch for multiobjective optimization
    2157 -- 2189Matteo Lapucci. A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
    2190 -- 2224Hiroshi Yamashita. Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
    2225 -- 2240Horatiu Cheval, Laurentiu Leustean. Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration
    2241 -- 2250Wim van Ackooij, Welington de Oliveira 0001. Addendum to the paper 'Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies'
    2251 -- 2272Dezhou Kong, Li Sun, Haibin Chen, Yun Wang. Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones
    2273 -- 2299Petar Kunstek, Marko Vrdoljak. A quasi-Newton method in shape optimization for a transmission problem
    2300 -- 2323Anqi Fu, Lei Xing 0001, Stephen P. Boyd. Operator splitting for adaptive radiation therapy with nonlinear health dynamics
    2324 -- 2351Mihai I. Florea. Exact gradient methods with memory
    2352 -- 2376Wenjie Wang, Pengyu Wang, Jiawei Yang, Fei Xiao, Weihua Zhang, Zeping Wu. Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front

    Volume 37, Issue 5

    1567 -- 1602Anatoli B. Juditsky, Arkadi Nemirovski. On well-structured convex-concave saddle point problems and variational inequalities with monotone operators
    1603 -- 1635Darina Dvinskikh. Stochastic approximation versus sample average approximation for Wasserstein barycenters
    1636 -- 1667Lukás Adam, Václav Mácha 0001, Václav Smídl, Tomás Pevný. General framework for binary classification on top samples
    1668 -- 1704Albert S. Berahas, Majid Jahani, Peter Richtárik, Martin Takác. Quasi-Newton methods for machine learning: forget the past, just sample
    1705 -- 1724Igor Konnov 0002. Exact penalties for decomposable convex optimization problems
    1725 -- 1739Mina Lotfi, S. Mohammad Hosseini. An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
    1740 -- 1769Ramzi Ben Mhenni, Sébastien Bourguignon, Jordan Ninin. Global optimization for sparse solution of least squares problems
    1770 -- 1804Andreas Fischer 0004, Alain B. Zemkoho, Shenglong Zhou 0001. Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
    1805 -- 1819Fatemeh Keshavarz-Kohjerdi. Off-line exploration of rectangular cellular environments with a rectangular obstacle
    1820 -- 1844Xiao Liu, Chungen Shen, Li Wang. A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
    1845 -- 1875Ion Necoara. Stochastic block projection algorithms with extrapolation for convex feasibility problems
    1876 -- 1911Giorgio Costa, Roy H. Kwon. Data-driven distributionally robust risk parity portfolio optimization
    1912 -- 1929Mahdi Roozbeh, Saman Babaie-Kafaki, Zohre Aminifard. Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines
    1930 -- 1964Andrei Draganescu, Mona Hajghassem. Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time

    Volume 37, Issue 4

    1205 -- 1241Nachuan Xiao, Xin Liu 0001, Ya-Xiang Yuan. A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
    1242 -- 1268Francisco Facchinei, Vyacheslav Kungurtsev, Lorenzo Lampariello, Gesualdo Scutari. Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case
    1269 -- 1288Aliyu Muhammed Awwal, Poom Kumam, Lin Wang, Mahmoud Muhammad Yahaya, Hassan Mohammad. On the Barzilai-Borwein gradient methods with structured secant equation for nonlinear least squares problems
    1289 -- 1309Adil M. Bagirov, Sona Taheri, Napsu Karmitsa, Nargiz Sultanova, Soodabeh Asadi. 1-regression via nonsmooth DC optimization
    1310 -- 1343Hani Ahmadzadeh, Nezam Mahdavi-Amiri. A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
    1344 -- 1369Alexandre Ghannad, Dominique Orban, Michael A. Saunders. Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
    1370 -- 1383Abdulkarim Hassan Ibrahim, Poom Kumam, Ahmad Kamandi, Auwal Bala Abubakar. An efficient hybrid conjugate gradient method for unconstrained optimization
    1384 -- 1414Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina. Solution approaches for the vehicle routing problem with occasional drivers and time windows
    1415 -- 1446Morteza Maleknia, Mostafa Shamsi. A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
    1447 -- 1470Zhang Wei, Kees Roos. Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
    1471 -- 1506Songqiang Qiu. A globally convergent regularized interior point method for constrained optimization
    1507 -- 1526Xiaokai Chang, Sanyang Liu, Zhao Deng, Suoping Li. An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems
    1527 -- 1565Olaniyi Samuel Iyiola, Cyril D. Enyi, Yekini Shehu. Reflected three-operator splitting method for monotone inclusion problem

    Volume 37, Issue 3

    801 -- 829Jordi Castro, Paula de la Lama-Zubirán. A new interior-point approach for large separable convex quadratic two-stage stochastic problems
    830 -- 843M. R. Eslahchi, S. Bojari. Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
    844 -- 877Frank E. Curtis, Rui Shi. A fully stochastic second-order trust region method
    878 -- 906Yurii E. Nesterov. Inexact basic tensor methods for some classes of convex optimization problems
    907 -- 935Anton Anikin 0002, Alexander V. Gasnikov, Alexander Gornov, Dmitry Kamzolov, Yury Maximov, Yurii E. Nesterov. Efficient numerical methods to solve sparse linear equations with application to PageRank
    936 -- 953Yurii E. Nesterov, Mihai I. Florea. Gradient methods with memory
    954 -- 981David Avis, David Bremner. Sparktope: linear programs from algorithms
    982 -- 1005Mehran Hasanzadeh, Behrooz Alizadeh, Fahimeh Baroughi 0001. Optimal algorithms for some inverse uncapacitated facility location problems on networks
    1006 -- 1026Daniel Dörfler, Andreas Löhne, Christopher Schneider, Benjamin Weißing. A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
    1027 -- 1064Riley Badenbroek, Joachim Dahl. An algorithm for nonsymmetric conic optimization inspired by MOSEK
    1065 -- 1086Beatriz Brito Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Mauricio G. C. Resende. A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation
    1087 -- 1121Hassan Rafique, Mingrui Liu, Qihang Lin, Tianbao Yang. Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
    1122 -- 1144Paola Festa, Serena Fugaro, Francesca Guerriero. Shortest path reoptimization vs resolution from scratch: a computational comparison
    1145 -- 1164Jingyong Tang, Jinchuan Zhou. A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems
    1165 -- 1202Ludwig Kampel, Michael Wagner 0026, Ilias S. Kotsireas, Dimitris E. Simos. A primer on the application of neural networks to covering array generation

    Volume 37, Issue 2

    405 -- 424Ernesto G. Birgin, Luis Felipe Bueno, José Mario Martínez. On the complexity of solving feasibility problems with regularized models
    425 -- 450Matthew E. Wilhelm, Matthew D. Stuber. EAGO.jl: easy advanced global optimization in Julia
    451 -- 479Lukás Adam, Václav Mácha 0001. Projections onto the canonical simplex with additional linear inequalities
    480 -- 502Matthew R. Billingsley, Paul I. Barton. Generalized derivatives of computer programs
    503 -- 545Tim Hoheisel, Blanca Pablos, Aram-Alexandre Pooladian, Alexandra Schwartz, Luke Steverango. A study of one-parameter regularization methods for mathematical programs with vanishing constraints
    546 -- 576Reza Najian Asl, Ihar Antonau, Aditya Ghantasala, Wulf G. Dettmer, Roland Wüchner, Kai-Uwe Bletzinger. A partitioned scheme for adjoint shape sensitivity analysis of fluid-structure interactions involving non-matching meshes
    577 -- 604Stanislav Baklanov, Maria Stefanova, Sergey Lupuleac. Newton projection method as applied to assembly simulation
    605 -- 638Geovani Nunes Grapiglia, Yurii E. Nesterov. Tensor methods for finding approximate stationary points of convex functions
    639 -- 657Abdelouafi Ghazi, Ahmed Roubi. A DC approach for minimax fractional optimization programs with ratios of convex functions
    658 -- 691Vanessa Krebs, Martin Schmidt 0003. Γ-robust linear complementarity problems
    692 -- 711I. G. Akrotirianakis, M. Gratton, Joshua Griffin, Seyed Alireza Yektamaram, Wenwen Zhou. Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem
    712 -- 752Yuan Zhang, Huifu Xu, Wei Wang 0324. Preference robust models in multivariate utility-based shortfall risk minimization
    753 -- 771Heejune Sheen, Makoto Yamashita. Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
    772 -- 799Michael Herty, Sonja Steffensen, Anna Thünen. Solving quadratic multi-leader-follower games by smoothing the follower's best response

    Volume 37, Issue 1

    1 -- 22Qingqiong Cai, Neng Fan, Yongtang Shi, Shunyu Yao. Integer linear programming formulations for double roman domination problem
    23 -- 44Cesar Beltran-Royo. Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems
    45 -- 78Chin Pang Ho, Michal Kocvara, Panos Parpas. Newton-type multilevel optimization method
    79 -- 112Hao Wang 0045, Fan Zhang, Jiashan Wang, Yuyang Rong. An inexact first-order method for constrained nonlinear optimization
    113 -- 149Masoud Ahookhosh, Ronan M. T. Fleming, Phan Tu Vuong. Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods
    150 -- 174Ali Gharaei, Fariborz Jolai. Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem
    175 -- 191L. Calderón, Maria Aparecida Diniz Ehrhardt, José Mario Martínez. On high-order model regularization for multiobjective optimization
    192 -- 213Soodabeh Asadi, N. Mahdavi-Amiri, Zsolt Darvay, Petra Renáta Rigó. Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
    214 -- 240Max L. N. Gonçalves, Jefferson G. Melo, Renato D. C. Monteiro. Projection-free accelerated method for convex optimization
    241 -- 263Christopher John Price. 1 penalty functions
    264 -- 294Jinlong Lei, Uday V. Shanbhag. Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
    295 -- 319Elvis M. R. Torrealba, Luiz Carlos Matioli, Mostafa Nasri, R. A. Castillo. Exponential augmented Lagrangian methods for equilibrium problems
    320 -- 337Yi-Fen Ke, Changfeng Ma. On SOR-like iteration methods for solving weakly nonlinear systems
    338 -- 360Anuj Bajaj, Boris S. Mordukhovich, Nguyen Mau Nam, Tuyen Tran. Solving a continuous multifacility location problem by DC algorithms
    361 -- 386Henri Calandra, Serge Gratton, Elisa Riccietti, Xavier Vasseur. On a multilevel Levenberg-Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations
    387 -- 403Haibin Chen, Liqun Qi 0001, Yiju Wang, Guanglu Zhou. Further results on sum-of-squares tensors
    runs on