Optimization Methods & Software

Article	Citations
Inexact model: a framework for optimization and variational inequalities	31
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning	27
Stochastic distributed learning with gradient quantization and double-variance reduction	18
An efficient hybrid conjugate gradient method for unconstrained optimization	16
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection	14
Quasi-Newton methods for machine learning: forget the past, just sample	13
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints	11
On the numerical performance of finite-difference-based methods for derivative-free optimization	10
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems	9
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments	9
Inexact basic tensor methods for some classes of convex optimization problems	8
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems	8
Two families of hybrid conjugate gradient methods with restart procedures and their applications	7
Reflected three-operator splitting method for monotone inclusion problem	7
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration	6
Global optimization for sparse solution of least squares problems	6
AB/Push-Pull method for distributed optimization in time-varying directed networks	6
A fully stochastic second-order trust region method	6
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines	6
On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems	5
Accelerated gradient methods with absolute and relative noise in the gradient	5
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization	5
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation	5
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators	4
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization	4

Robust piecewise linearL1-regression via nonsmooth DC optimization	4
HyKKT: a hybrid direct-iterative method for solving KKT linear systems	4
On minty variational principle for quasidifferentiable vector optimization problems	4
Solving SDP completely with an interior point oracle	4
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights	4
Solution approaches for the vehicle routing problem with occasional drivers and time windows	4
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems	4
An algorithm for nonsymmetric conic optimization inspired by MOSEK	4
Decentralized gradient tracking with local steps	3
Full-low evaluation methods for derivative-free optimization	3
Outer approximation algorithms for convex vector optimization problems	3
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number	3
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions	3
Gradient methods with memory	3
Stochastic approximation versus sample average approximation for Wasserstein barycenters	3
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software	3
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays	2
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods	2
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments	2
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space	2
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems	2
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users	2
Off-line exploration of rectangular cellular environments with a rectangular obstacle	2
Data-driven distributionally robust risk parity portfolio optimization	2
A modified direction approach for proper efficiency of multiobjective optimization	2
An active set method for bound-constrained optimization	2
Efficient numerical methods to solve sparse linear equations with application to PageRank	2
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming	2
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case	2
Stochastic block projection algorithms with extrapolation for convex feasibility problems	2
A class of projected-search methods for bound-constrained optimization	2
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem	2
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results	2
A new multipoint symmetric secant method with a dense initial matrix	2
The role of local steps in local SGD	2
Projection onto the exponential cone: a univariate root-finding problem	1
Toward state estimation by high gain differentiators with automatic differentiation	1
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization	1
The Dai–Liao-type conjugate gradient methods for solving vector optimization problems	1
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions	1
Feasible Newton methods for symmetric tensor Z-eigenvalue problems	1
Sequential hierarchical least-squares programming for prioritized non-linear optimal control	1
PersA-FL : personalized asynchronous federated learning	1
Second-order cone programming for frictional contact mechanics using interior point algorithm	1
General framework for binary classification on top samples	1
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection	1
Exact penalties for decomposable convex optimization problems	1
A globally convergent regularized interior point method for constrained optimization	1
Tensorial total variation-based image and video restoration with optimized projection methods	1
On a Frank-Wolfe approach for abs-smooth functions	1

Optimal algorithms for some inverse uncapacitated facility location problems on networks	1
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems	1
Length-constrained cycle partition with an application to UAV routing*	1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics	1
Convergence analysis of stochastic higher-order majorization–minimization algorithms	1
PathWyse: a flexible, open-source library for the resource constrained shortest path problem	1
A gradient descent akin method for constrained optimization: algorithms and applications	1
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations	1
A branch and bound method solving the max–min linear discriminant analysis problem	1
A new inertial projected reflected gradient method with application to optimal control problems	1
Interior point methods for solving Pareto eigenvalue complementarity problems	1
A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method	1
Loraine – an interior-point solver for low-rank semidefinite programming	1
Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures	1
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium	1
An optimal interpolation set for model-based derivative-free optimization methods	1
Using first-order information in direct multisearch for multiobjective optimization	1
Distributionally robust expected residual minimization for stochastic variational inequality problems	1
Convergences for robust bilevel polynomial programmes with applications	1
Inexact tensor methods and their application to stochastic convex optimization	1
Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition	1
Exact gradient methods with memory	1
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies	1
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates	1
A symmetric grouped and ordered multi-secant Quasi-Newton update formula	0
Complexity of a class of first-order objective-function-free optimization algorithms	0
A note on the computational complexity of chain rule differentiation	0
Learning graph Laplacian with MCP	0
Predicting pairwise interaction affinities with ℓ 0 -penalized least squares–a nonsmooth bi-objective optimization based approach*	0
Analysis and comparison of two-level KFAC methods for training deep neural networks	0
Globalization of convergence of the constrained piecewise Levenberg–Marquardt method	0
Loan interest rate Nash models with solvency constraints in the banking sector	0
Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front	0
Maximizing the number of rides served for time-limited Dial-a-Ride*	0
Optimal inexactness schedules for tunable oracle-based methods	0
A quasi-Newton method in shape optimization for a transmission problem	0
On generalized Nash equilibrium problems in infinite-dimensional spaces using Nikaido–Isoda type functionals	0
A generic optimization framework for resilient systems	0
Automatic source code generation for deterministic global optimization with parallel architectures	0
On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions	0
Observability inequality of backward stochastic heat equations with Lévy process for measurable sets and its applications	0
A hybrid optimal control problem constrained with hyperelasticity and the global injectivity condition	0
A meta-heuristic extension of the Lagrangian heuristic framework	0
A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems	0
Decentralized saddle point problems via non-Euclidean mirror prox	0
An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs	0
Robust reverse 1-center problems on trees with interval costs	0
More on second-order properties of the Moreau regularization-approximation of a convex function	0
Preface	0
An efficient semismooth Newton method for adaptive sparse signal recovery problems	0
Discretization and quantification for distributionally robust optimization with decision-dependent ambiguity sets	0
Matrix extreme points and free extreme points of free spectrahedra	0
Tensor decompositions for count data that leverage stochastic and deterministic optimization	0
A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks	0
GBOML: a structure-exploiting optimization modelling language in Python	0
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem	0
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems	0
A piecewise smooth version of the Griewank function	0
An adaptive regularization method in Banach spaces	0
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error	0
Numerical methods for distributed stochastic compositional optimization problems with aggregative structure	0
Preface	0
A semismooth conjugate gradients method – theoretical analysis	0
Infinite dimensional tensor variational inequalities with applications to an economic equilibrium problem	0
Shortest path reoptimization vs resolution from scratch: a computational comparison	0
New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications	0
Dual formulation of the sparsity constrained optimization problem: application to classification	0
Towards global parameter estimation exploiting reduced data sets	0
A derivative free projection method for the singularities of vector fields with convex constraints on Hadamard manifolds	0
A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity	0
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices	0
An investigation of stochastic trust-region based algorithms for finite-sum minimization	0
Approximating Hessian matrices using Bayesian inference: a new approach for quasi-Newton methods in stochastic optimization	0
A highly efficient algorithm for solving exclusive lasso problems	0
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems	0
Jacobian sparsity detection using Bloom filters	0
Preface to the special issue	0
The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results	0
On a minimal criterion of efficiency in vector variational control problems	0
A family of limited memory three term conjugate gradient methods	0

A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property	0
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems	0
Distributionally robust joint chance-constrained programming with Wasserstein metric	0
An inexact restoration direct multisearch filter approach to multiobjective constrained derivative-free optimization	0
Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones	0
A mixed-integer programming formulation for optimizing the double row layout problem	0
Linear programming sensitivity measured by the optimal value worst-case analysis	0
Three-operator reflected forward-backward splitting algorithm with double inertial effects	0
Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints	0
An efficient model for the multiple allocation hub maximal covering problem	0
An incremental descent method for multi-objective optimization	0
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization	0
Editorial	0
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations	0
Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations	0
A new interior-point approach for large separable convex quadratic two-stage stochastic problems	0
Multiobjective optimization by using cutting angle methods and hypervolume criterion	0
A majorization penalty method for SVM with sparse constraint	0
Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’	0
A new inexact gradient descent method with applications to nonsmooth convex optimization	0
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems	0
Preface for the special edition of optimization methods and software	0
Efficient second-order optimization with predictions in differential games	0
Linear programming with nonparametric penalty programs and iterated thresholding	0
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes	0
Correction	0
Practical perspectives on symplectic accelerated optimization	0
A note on the generalized Hessian of the least squares associated with systems of linear inequalities	0
A hybrid direct search and projected simplex gradient method for convex constrained minimization	0
Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time	0
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems	0
Crossing edge minimization in radial outerplanar layered graphs using segment paths	0
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems	0
A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming	0
A new spectral conjugate subgradient method with application in computed tomography image reconstruction	0
IntSat: integer linear programming by conflict-driven constraint learning	0
Distributed learning with compressed gradient differences*	0
A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity	0
Numerical simulation of differential-algebraic equations with embedded global optimization criteria	0
A stochastic approximation method for convex programming with many semidefinite constraints	0
Foreword	0
Derivative-free bound-constrained optimization for solving structured problems with surrogate models	0
Using general triangle inequalities within quadratic convex reformulation method	0
Sparktope: linear programs from algorithms	0
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods	0
An ADMM based method for underdetermined box-constrained integer least squares problems	0
Shape-changing trust-region methods using multipoint symmetric secant matrices	0
Conic optimization-based algorithms for nonnegative matrix factorization	0
Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization	0
Closing duality gaps of SDPs completely through perturbation when singularity degree is one	0
Delay-tolerant distributed Bregman proximal algorithms	0
Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems	0
Sparse convex optimization toolkit: a mixed-integer framework	0
A primer on the application of neural networks to covering array generation	0
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network	0
Two modified conjugate gradient methods for unconstrained optimization	0
Optimized convergence of stochastic gradient descent by weighted averaging	0