Optimization Methods & Software

(The median citation count of Optimization Methods & Software is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-02-01 to 2024-02-01.)
COCO: a platform for comparing continuous optimizers in a black-box setting150
Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems39
An investigation of Newton-Sketch and subsampled Newton methods27
A dual approach for optimal algorithms in distributed optimization over networks26
Inexact model: a framework for optimization and variational inequalities25
Complexity and performance of an Augmented Lagrangian algorithm23
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning17
Gradient methods exploiting spectral properties13
Inexact SARAH algorithm for stochastic optimization13
Primal–dual accelerated gradient methods with small-dimensional relaxation oracle13
EAGO.jl: easy advanced global optimization in Julia11
An ADMM-based interior-point method for large-scale linear programming11
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection10
On inexact solution of auxiliary problems in tensor methods for convex optimization9
A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization9
An efficient hybrid conjugate gradient method for unconstrained optimization8
An efficient augmented Lagrangian method for support vector machine8
Stochastic distributed learning with gradient quantization and double-variance reduction7
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints7
Quasi-Newton methods for machine learning: forget the past, just sample7
Inexact basic tensor methods for some classes of convex optimization problems7
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass7
Composite optimization for the resource allocation problem7
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments6
Tensor methods for finding approximate stationary points of convex functions6
On basic operations related to network induction of discrete convex functions6
Γ-robust linear complementarity problems6
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems6
Reflected three-operator splitting method for monotone inclusion problem6
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems5
On SOR-like iteration methods for solving weakly nonlinear systems5
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function5
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines5
Training GANs with centripetal acceleration5
Newton projection method as applied to assembly simulation5
Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes4
On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems4
On high-order model regularization for multiobjective optimization4
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems4
An algorithm for nonsymmetric conic optimization inspired by MOSEK4
On the numerical performance of finite-difference-based methods for derivative-free optimization4
Stability analysis of a class of sparse optimization problems4
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration4
Robust piecewise linear L1-regression via nonsmooth DC optimization4
A DC approach for minimax fractional optimization programs with ratios of convex functions4
Global optimization for sparse solution of least squares problems4
Two families of hybrid conjugate gradient methods with restart procedures and their applications3
Solving SDP completely with an interior point oracle3
Projection-free accelerated method for convex optimization3
An alternating direction method of multipliers for the eigenvalue complementarity problem3
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization3
Stochastic approximation versus sample average approximation for Wasserstein barycenters3
Solving quadratic multi-leader-follower games by smoothing the follower's best response3
Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection3
Gradient methods with memory3
A fully stochastic second-order trust region method3
Preference robust models in multivariate utility-based shortfall risk minimization3
Further results on sum-of-squares tensors3
A new multipoint symmetric secant method with a dense initial matrix2
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users2
Cooperative differential games with continuous updating using Hamilton–Jacobi–Bellman equation2
Data-driven distributionally robust risk parity portfolio optimization2
On the abs-polynomial expansion of piecewise smooth functions2
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators2
Solution approaches for the vehicle routing problem with occasional drivers and time windows2
A primal-dual interior point trust-region method for nonlinear semidefinite programming2
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software2
Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method2
A study of one-parameter regularization methods for mathematical programs with vanishing constraints2
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results2
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case2
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number2
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays2
Accelerated gradient methods with absolute and relative noise in the gradient2
On minty variational principle for quasidifferentiable vector optimization problems1
Exact gradient methods with memory1
Efficient numerical methods to solve sparse linear equations with application to PageRank1
Optimal algorithms for some inverse uncapacitated facility location problems on networks1
On a multilevel Levenberg–Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations1
Convergence analysis of stochastic higher-order majorization–minimization algorithms1
A Newton-bracketing method for a simple conic optimization problem1
Full-low evaluation methods for derivative-free optimization1
Interior point methods for solving Pareto eigenvalue complementarity problems1
AB/Push-Pull method for distributed optimization in time-varying directed networks1
Exact penalties for decomposable convex optimization problems1
Signed ring families and signed posets1
A modified direction approach for proper efficiency of multiobjective optimization1
Loraine – an interior-point solver for low-rank semidefinite programming1
Outer approximation algorithms for convex vector optimization problems1
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions1
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems1
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems1
Using first-order information in direct multisearch for multiobjective optimization1
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies1
On a transformation of the ∗-congruence Sylvester equation for the least squares optimization1
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization1
Stochastic proximal linear method for structured non-convex problems1
Stochastic block projection algorithms with extrapolation for convex feasibility problems1
A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method1
Feasible Newton methods for symmetric tensor Z-eigenvalue problems1
The rate of convergence of proximal method of multipliers for nonlinear programming1
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems1
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation1
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming1
Tensorial total variation-based image and video restoration with optimized projection methods1
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium1
The role of local steps in local SGD1
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates1
Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions1
Projection onto the exponential cone: a univariate root-finding problem1
Off-line exploration of rectangular cellular environments with a rectangular obstacle1
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding1
A globally convergent regularized interior point method for constrained optimization1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics1
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods1