Optimization Methods & Software

Papers
(The median citation count of Optimization Methods & Software is 0. 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 2021-02-01 to 2025-02-01.)
ArticleCitations
Analysis and comparison of two-level KFAC methods for training deep neural networks33
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes27
New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications18
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation16
A note on the computational complexity of chain rule differentiation14
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems13
Preface10
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations9
A majorization penalty method for SVM with sparse constraint9
Two modified conjugate gradient methods for unconstrained optimization9
An adaptive regularization method in Banach spaces8
General framework for binary classification on top samples7
Sparse convex optimization toolkit: a mixed-integer framework7
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines6
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations6
Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition6
An active set method for bound-constrained optimization5
Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization5
GBOML: a structure-exploiting optimization modelling language in Python5
An efficient model for the multiple allocation hub maximal covering problem4
Derivative-free bound-constrained optimization for solving structured problems with surrogate models4
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments4
More on second-order properties of the Moreau regularization-approximation of a convex function4
Second-order cone programming for frictional contact mechanics using interior point algorithm4
An inexact restoration direct multisearch filter approach to multiobjective constrained derivative-free optimization4
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods4
Linear programming sensitivity measured by the optimal value worst-case analysis4
A meta-heuristic extension of the Lagrangian heuristic framework4
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning3
Discretization and quantification for distributionally robust optimization with decision-dependent ambiguity sets3
Line-search based optimization using function approximations with tunable accuracy3
Outer approximation algorithms for convex vector optimization problems3
A gradient descent akin method for constrained optimization: algorithms and applications3
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection3
Exact gradient methods with memory2
On a minimal criterion of efficiency in vector variational control problems2
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems2
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices2
Predicting pairwise interaction affinities with ℓ 0 -penalized least squares–a nonsmooth bi-objective optimization based approach*2
Shortest path reoptimization vs resolution from scratch: a computational comparison2
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem2
On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions2
PersA-FL : personalized asynchronous federated learning2
Practical perspectives on symplectic accelerated optimization2
Distributionally robust expected residual minimization for stochastic variational inequality problems2
Complexity of a class of first-order objective-function-free optimization algorithms2
A modified direction approach for proper efficiency of multiobjective optimization2
Inexact tensor methods and their application to stochastic convex optimization2
PathWyse: a flexible, open-source library for the resource constrained shortest path problem2
Distributed learning with compressed gradient differences*2
Towards global parameter estimation exploiting reduced data sets2
Linear programming with nonparametric penalty programs and iterated thresholding2
Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time2
A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property1
Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints1
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods1
A mixed-integer programming formulation for optimizing the double row layout problem1
Numerical methods for distributed stochastic compositional optimization problems with aggregative structure1
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network1
An optimal interpolation set for model-based derivative-free optimization methods1
Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front1
Data-driven distributionally robust risk parity portfolio optimization1
Quasi-Newton methods for machine learning: forget the past, just sample1
Automatic source code generation for deterministic global optimization with parallel architectures1
Decentralized saddle point problems via non-Euclidean mirror prox1
Foreword1
Conic optimization-based algorithms for nonnegative matrix factorization1
A quasi-Newton method in shape optimization for a transmission problem1
Distributionally robust joint chance-constrained programming with Wasserstein metric1
Multiobjective optimization by using cutting angle methods and hypervolume criterion1
Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems1
Feasible Newton methods for symmetric tensor Z-eigenvalue problems1
SLiSeS: subsampled line search spectral gradient method for finite sums1
Accelerated gradient methods with absolute and relative noise in the gradient1
Robust reverse 1-center problems on trees with interval costs1
IntSat: integer linear programming by conflict-driven constraint learning1
Stochastic block projection algorithms with extrapolation for convex feasibility problems1
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays1
An efficient semismooth Newton method for adaptive sparse signal recovery problems1
Operator splitting for adaptive radiation therapy with nonlinear health dynamics1
A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks1
A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming1
Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems1
A class of projected-search methods for bound-constrained optimization1
A new inexact gradient descent method with applications to nonsmooth convex optimization1
A piecewise smooth version of the Griewank function1
Editorial1
A hybrid optimal control problem constrained with hyperelasticity and the global injectivity condition1
Numerical simulation of differential-algebraic equations with embedded global optimization criteria1
Correction0
Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’0
On a Frank-Wolfe approach for abs-smooth functions0
Jacobian sparsity detection using Bloom filters0
Dual formulation of the sparsity constrained optimization problem: application to classification0
Preface to the special issue0
Loan interest rate Nash models with solvency constraints in the banking sector0
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium0
Iterative methods for projection onto the ℓ p quasi-norm ball0
Tensor decompositions for count data that leverage stochastic and deterministic optimization0
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error0
A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity0
Stochastic approximation versus sample average approximation for Wasserstein barycenters0
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization0
Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones0
Preface0
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems0
Using first-order information in direct multisearch for multiobjective optimization0
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions0
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies0
Shape-changing trust-region methods using multipoint symmetric secant matrices0
An investigation of stochastic trust-region based algorithms for finite-sum minimization0
Tensorial total variation-based image and video restoration with optimized projection methods0
Some upgrading problems on networks related to eccentricity concept0
Infinite dimensional tensor variational inequalities with applications to an economic equilibrium problem0
A new spectral conjugate subgradient method with application in computed tomography image reconstruction0
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users0
An efficient hybrid conjugate gradient method for unconstrained optimization0
Stochastic distributed learning with gradient quantization and double-variance reduction0
Two families of hybrid conjugate gradient methods with restart procedures and their applications0
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results0
A semismooth conjugate gradients method – theoretical analysis0
Inexact model: a framework for optimization and variational inequalities0
The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results0
Observability inequality of backward stochastic heat equations with Lévy process for measurable sets and its applications0
PDE-constrained shape optimization with first-order and Newton-type methods in the W 1,∞ topology0
Optimal inexactness schedules for tunable oracle-based methods0
A stochastic approximation method for convex programming with many semidefinite constraints0
Sequential hierarchical least-squares programming for prioritized non-linear optimal control0
NPPro: a Newton projection with proportioning solver for quadratic programming with affine constraints0
Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures0
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems0
Approximating Hessian matrices using Bayesian inference: a new approach for quasi-Newton methods in stochastic optimization0
A symmetric grouped and ordered multi-secant Quasi-Newton update formula0
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems0
HyKKT: a hybrid direct-iterative method for solving KKT linear systems0
A new multipoint symmetric secant method with a dense initial matrix0
A generic optimization framework for resilient systems0
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions0
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems0
Full-low evaluation methods for derivative-free optimization0
A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method0
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments0
Global optimization for sparse solution of least squares problems0
The role of local steps in local SGD0
Interior point methods for solving Pareto eigenvalue complementarity problems0
Length-constrained cycle partition with an application to UAV routing*0
Loraine – an interior-point solver for low-rank semidefinite programming0
A globally convergent regularized interior point method for constrained optimization0
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems0
On generalized Nash equilibrium problems in infinite-dimensional spaces using Nikaido–Isoda type functionals0
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number0
Projection onto the exponential cone: a univariate root-finding problem0
Convergences for robust bilevel polynomial programmes with applications0
A note on the generalized Hessian of the least squares associated with systems of linear inequalities0
A branch and bound method solving the max–min linear discriminant analysis problem0
An ADMM based method for underdetermined box-constrained integer least squares problems0
Globalization of convergence of the constrained piecewise Levenberg–Marquardt method0
Using general triangle inequalities within quadratic convex reformulation method0
Learning graph Laplacian with MCP0
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights0
Optimized convergence of stochastic gradient descent by weighted averaging0
Least squares monotonic unimodal approximations to successively updated data and an application to a Covid-19 outbreak0
The Dai–Liao-type conjugate gradient methods for solving vector optimization problems0
An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs0
Convergence analysis of stochastic higher-order majorization–minimization algorithms0
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization0
A hybrid direct search and projected simplex gradient method for convex constrained minimization0
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization0
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem0
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software0
Toward state estimation by high gain differentiators with automatic differentiation0
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators0
Maximizing the number of rides served for time-limited Dial-a-Ride*0
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates0
Two RMIL-type schemes with compressed sensing applications0
A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems0
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration0
A new inertial projected reflected gradient method with application to optimal control problems0
Efficient second-order optimization with predictions in differential games0
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems0
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems0
Delay-tolerant distributed Bregman proximal algorithms0
Matrix extreme points and free extreme points of free spectrahedra0
On minty variational principle for quasidifferentiable vector optimization problems0
Exact penalties for decomposable convex optimization problems0
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming0
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space0
Crossing edge minimization in radial outerplanar layered graphs using segment paths0
An algorithm for nonsymmetric conic optimization inspired by MOSEK0
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems0
An incremental descent method for multi-objective optimization0
Reflected three-operator splitting method for monotone inclusion problem0
Off-line exploration of rectangular cellular environments with a rectangular obstacle0
Decentralized gradient tracking with local steps0
A derivative free projection method for the singularities of vector fields with convex constraints on Hadamard manifolds0
A primer on the application of neural networks to covering array generation0
A family of limited memory three term conjugate gradient methods0
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection0
Solution approaches for the vehicle routing problem with occasional drivers and time windows0
Preface for the special edition of optimization methods and software0
On the numerical performance of finite-difference-based methods for derivative-free optimization0
Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations0
An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds0
A highly efficient algorithm for solving exclusive lasso problems0
Optimal algorithms for some inverse uncapacitated facility location problems on networks0
Closing duality gaps of SDPs completely through perturbation when singularity degree is one0
AB/Push-Pull method for distributed optimization in time-varying directed networks0
A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity0
Three-operator reflected forward-backward splitting algorithm with double inertial effects0
0.12803602218628