Optimization Methods & Software

Article	Citations
Analysis and comparison of two-level KFAC methods for training deep neural networks	35
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes	31
A note on the computational complexity of chain rule differentiation	23
An efficient model for the multiple allocation hub maximal covering problem	19
A gradient descent akin method for constrained optimization: algorithms and applications	14
Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition	14
Preface	12
Two modified conjugate gradient methods for unconstrained optimization	10
GBOML: a structure-exploiting optimization modelling language in Python	9
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines	9
More on second-order properties of the Moreau regularization-approximation of a convex function	9
A meta-heuristic extension of the Lagrangian heuristic framework	6
Second-order cone programming for frictional contact mechanics using interior point algorithm	6
Discretization and quantification for distributionally robust optimization with decision-dependent ambiguity sets	6
Exact gradient methods with memory	5
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations	5
General framework for binary classification on top samples	5
Sparse convex optimization toolkit: a mixed-integer framework	4
An adaptive regularization method in Banach spaces	4
A majorization penalty method for SVM with sparse constraint	4
New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications	4
Derivative-free bound-constrained optimization for solving structured problems with surrogate models	4
Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization	4
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems	4
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments	4

Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods	4
An active set method for bound-constrained optimization	3
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations	3
PersA-FL : personalized asynchronous federated learning	3
On a minimal criterion of efficiency in vector variational control problems	3
Linear programming sensitivity measured by the optimal value worst-case analysis	3
Line-search based optimization using function approximations with tunable accuracy	3
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems	3
Outer approximation algorithms for convex vector optimization problems	3
An inexact restoration direct multisearch filter approach to multiobjective constrained derivative-free optimization	3
Predicting pairwise interaction affinities with ℓ 0 -penalized least squares–a nonsmooth bi-objective optimization based approach*	3
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices	3
On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions	2
Multiobjective optimization by using cutting angle methods and hypervolume criterion	2
Inexact tensor methods and their application to stochastic convex optimization	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
Towards global parameter estimation exploiting reduced data sets	2
SLiSeS: subsampled line search spectral gradient method for finite sums	2
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems	2
Complexity of a class of first-order objective-function-free optimization algorithms	2
An optimal interpolation set for model-based derivative-free optimization methods	2
Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems	2
A quasi-Newton method in shape optimization for a transmission problem	2
The largest- K -norm for general measure spaces and a DC reformulation for L 0 -constrained problems in function sp	2
A new inexact gradient descent method with applications to nonsmooth convex optimization	2
A piecewise smooth version of the Griewank function	2
PathWyse: a flexible, open-source library for the resource constrained shortest path problem	2
Correction	2
Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time	2
Feasible Newton methods for symmetric tensor Z-eigenvalue problems	2
Numerical methods for distributed stochastic compositional optimization problems with aggregative structure	2
Linear programming with nonparametric penalty programs and iterated thresholding	2
A modified Polak-Ribière-Polyak type conjugate gradient method for vector optimization	1
A class of projected-search methods for bound-constrained optimization	1
Accelerated gradient methods with absolute and relative noise in the gradient	1
A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks	1
A highly efficient algorithm for solving exclusive lasso problems	1
A hybrid optimal control problem constrained with hyperelasticity and the global injectivity condition	1
A hybrid direct search and projected simplex gradient method for convex constrained minimization	1
Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures	1
Distributed learning with compressed gradient differences*	1
An efficient semismooth Newton method for adaptive sparse signal recovery problems	1
Numerical simulation of differential-algebraic equations with embedded global optimization criteria	1
The mirror-prox sliding method for non-smooth decentralized saddle-point problems	1
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network	1
A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming	1
Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front	1
Conic optimization-based algorithms for nonnegative matrix factorization	1
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems	1
Decentralized saddle point problems via non-Euclidean mirror prox	1

Foreword	1
The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results	1
A first-order regularized approach to the order-value optimization problem	1
A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity	1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics	1
Data-driven distributionally robust risk parity portfolio optimization	1
Distributionally robust expected residual minimization for stochastic variational inequality problems	1
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem	1
Practical perspectives on symplectic accelerated optimization	1
Stochastic block projection algorithms with extrapolation for convex feasibility problems	1
IntSat: integer linear programming by conflict-driven constraint learning	1
Robust reverse 1-center problems on trees with interval costs	1
A mixed-integer programming formulation for optimizing the double row layout problem	1
Distributionally robust joint chance-constrained programming with Wasserstein metric	1
Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints	1
Using first-order information in direct multisearch for multiobjective optimization	0
Two families of hybrid conjugate gradient methods with restart procedures and their applications	0
Scaled alternating multiplier method for solving the matrix equation AXB + CXD = E	0
Two RMIL-type schemes with compressed sensing applications	0
Length-constrained cycle partition with an application to UAV routing*	0
Closing duality gaps of SDPs completely through perturbation when singularity degree is one	0
A new inertial projected reflected gradient method with application to optimal control problems	0
The Dai–Liao-type conjugate gradient methods for solving vector optimization problems	0
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results	0
Reflected three-operator splitting method for monotone inclusion problem	0
Soft quasi-Newton: guaranteed positive definiteness by relaxing the secant constraint	0
Tensor decompositions for count data that leverage stochastic and deterministic optimization	0
Using general triangle inequalities within quadratic convex reformulation method	0
The role of local steps in local SGD	0
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization	0
Global optimization for sparse solution of least squares problems	0
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments	0
Sequential hierarchical least-squares programming for prioritized non-linear optimal control	0
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error	0
An incremental descent method for multi-objective optimization	0
Preface	0
Dual formulation of the sparsity constrained optimization problem: application to classification	0
Shape-changing trust-region methods using multipoint symmetric secant matrices	0
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems	0
A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems	0
Preface for the special edition of optimization methods and software	0
Projection onto the exponential cone: a univariate root-finding problem	0
A family of limited memory three term conjugate gradient methods	0
An efficient hybrid conjugate gradient method for unconstrained optimization	0
NPPro: a Newton projection with proportioning solver for quadratic programming with affine constraints	0
Tensorial total variation-based image and video restoration with optimized projection methods	0
On the convergence of Newton-type proximal gradient method for multiobjective optimization problems	0
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number	0
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium	0
A symmetric grouped and ordered multi-secant Quasi-Newton update formula	0
Solution approaches for the vehicle routing problem with occasional drivers and time windows	0
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users	0
Optimal inexactness schedules for tunable oracle-based methods	0
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems	0
Convergence analysis of stochastic higher-order majorization–minimization algorithms	0
An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds	0
Stochastic approximation versus sample average approximation for Wasserstein barycenters	0
A branch and bound method solving the max–min linear discriminant analysis problem	0
On the numerical performance of finite-difference-based methods for derivative-free optimization	0
Quasi-Newton methods for machine learning: forget the past, just sample	0
A stochastic approximation method for convex programming with many semidefinite constraints	0
A semismooth conjugate gradients method – theoretical analysis	0
Crossing edge minimization in radial outerplanar layered graphs using segment paths	0
Toward state estimation by high gain differentiators with automatic differentiation	0
Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones	0
Distributed saddle point problems: lower bounds, near-optimal and robust algorithms*	0
Some upgrading problems on networks related to eccentricity concept	0
Infinite dimensional tensor variational inequalities with applications to an economic equilibrium problem	0
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems	0
PDE-constrained shape optimization with first-order and Newton-type methods in the W 1,∞ topology	0
A primer on the application of neural networks to covering array generation	0
An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs	0
Three-operator reflected forward-backward splitting algorithm with double inertial effects	0
Stochastic distributed learning with gradient quantization and double-variance reduction	0
Off-line exploration of rectangular cellular environments with a rectangular obstacle	0
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization	0
Decentralized gradient tracking with local steps	0
Globalization of convergence of the constrained piecewise Levenberg–Marquardt method	0
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems	0
Loraine – an interior-point solver for low-rank semidefinite programming	0

A Newton-type proximal gradient method for nonlinear multi-objective optimization problems	0
Correction	0
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions	0
A new multipoint symmetric secant method with a dense initial matrix	0
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates	0
Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’	0
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions	0
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies	0
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software	0
Observability inequality of backward stochastic heat equations with Lévy process for measurable sets and its applications	0
Automatic source code generation for deterministic global optimization with parallel architectures	0
HyKKT: a hybrid direct-iterative method for solving KKT linear systems	0
Convergences for robust bilevel polynomial programmes with applications	0
A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity	0
Iterative methods for projection onto the ℓ p quasi-norm ball	0
A new spectral conjugate subgradient method with application in computed tomography image reconstruction	0
AB/Push-Pull method for distributed optimization in time-varying directed networks	0
On a Frank-Wolfe approach for abs-smooth functions	0
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems	0
Approximating Hessian matrices using Bayesian inference: a new approach for quasi-Newton methods in stochastic optimization	0
Preface to the special issue	0
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays	0
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space	0
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem	0
Reduced basis model predictive control for semilinear parabolic partial differential equations	0
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights	0
Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations	0
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration	0
A globally convergent regularized interior point method for constrained optimization	0
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators	0
An investigation of stochastic trust-region based algorithms for finite-sum minimization	0
A note on the generalized Hessian of the least squares associated with systems of linear inequalities	0
Exact penalties for decomposable convex optimization problems	0
Inexact model: a framework for optimization and variational inequalities	0
An ADMM based method for underdetermined box-constrained integer least squares problems	0
A derivative free projection method for the singularities of vector fields with convex constraints on Hadamard manifolds	0
Efficient second-order optimization with predictions in differential games	0
On generalized Nash equilibrium problems in infinite-dimensional spaces using Nikaido–Isoda type functionals	0
Cone-compactness of a set and related topological properties: stability issues and applications	0
Optimized convergence of stochastic gradient descent by weighted averaging	0
Delay-tolerant distributed Bregman proximal algorithms	0
On minty variational principle for quasidifferentiable vector optimization problems	0
An interior point method for nonlinear constrained derivative-free optimization	0
Maximizing the number of rides served for time-limited Dial-a-Ride*	0
Interior point methods for solving Pareto eigenvalue complementarity problems	0
Matrix extreme points and free extreme points of free spectrahedra	0
A generic optimization framework for resilient systems	0
A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method	0
Jacobian sparsity detection using Bloom filters	0
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization	0
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection	0
Full-low evaluation methods for derivative-free optimization	0
A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property	0
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming	0
Learning graph Laplacian with MCP	0
Least squares monotonic unimodal approximations to successively updated data and an application to a Covid-19 outbreak	0