Optimization Methods & Software

Papers
(The TQCC of Optimization Methods & Software is 2. 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-04-01 to 2024-04-01.)
ArticleCitations
COCO: a platform for comparing continuous optimizers in a black-box setting159
A dual approach for optimal algorithms in distributed optimization over networks27
Inexact model: a framework for optimization and variational inequalities26
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning20
An ADMM-based interior-point method for large-scale linear programming13
Inexact SARAH algorithm for stochastic optimization13
EAGO.jl: easy advanced global optimization in Julia11
On inexact solution of auxiliary problems in tensor methods for convex optimization10
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection10
An efficient hybrid conjugate gradient method for unconstrained optimization9
Quasi-Newton methods for machine learning: forget the past, just sample8
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints8
Stochastic distributed learning with gradient quantization and double-variance reduction8
Γ-robust linear complementarity problems7
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems7
Tensor methods for finding approximate stationary points of convex functions7
Inexact basic tensor methods for some classes of convex optimization problems7
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments7
On basic operations related to network induction of discrete convex functions6
Reflected three-operator splitting method for monotone inclusion problem6
Training GANs with centripetal acceleration6
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems5
Newton projection method as applied to assembly simulation5
A DC approach for minimax fractional optimization programs with ratios of convex functions5
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines5
Global optimization for sparse solution of least squares problems5
On SOR-like iteration methods for solving weakly nonlinear systems5
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization4
Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration4
Robust piecewise linear L1-regression via nonsmooth DC optimization4
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems4
On the numerical performance of finite-difference-based methods for derivative-free optimization4
On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems4
Two families of hybrid conjugate gradient methods with restart procedures and their applications4
Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes4
An algorithm for nonsymmetric conic optimization inspired by MOSEK4
Gradient methods with memory3
Stochastic approximation versus sample average approximation for Wasserstein barycenters3
Preference robust models in multivariate utility-based shortfall risk minimization3
Solving quadratic multi-leader-follower games by smoothing the follower's best response3
On well-structured convex–concave saddle point problems and variational inequalities with monotone operators3
A primal-dual interior point trust-region method for nonlinear semidefinite programming3
A fully stochastic second-order trust region method3
Accelerated gradient methods with absolute and relative noise in the gradient3
Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection3
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems3
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number3
Solving SDP completely with an interior point oracle3
Further results on sum-of-squares tensors3
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems2
A Newton-bracketing method for a simple conic optimization problem2
Cooperative differential games with continuous updating using Hamilton–Jacobi–Bellman equation2
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization2
A class of projected-search methods for bound-constrained optimization2
On the abs-polynomial expansion of piecewise smooth functions2
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results2
A new multipoint symmetric secant method with a dense initial matrix2
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case2
AB/Push-Pull method for distributed optimization in time-varying directed networks2
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays2
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods2
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation2
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions2
Solution approaches for the vehicle routing problem with occasional drivers and time windows2
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users2
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software2
Data-driven distributionally robust risk parity portfolio optimization2
Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method2
A study of one-parameter regularization methods for mathematical programs with vanishing constraints2
0.023942947387695