Computational Optimization and Applications

Papers
(The TQCC of Computational Optimization and Applications is 4. 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.)
ArticleCitations
Weak convergence of iterative methods for solving quasimonotone variational inequalities67
Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods40
Global optimization via inverse distance weighting and radial basis functions31
Inexact first-order primal–dual algorithms24
An inexact accelerated stochastic ADMM for separable convex optimization23
Algorithms for stochastic optimization with function or expectation constraints22
An interior point-proximal method of multipliers for convex quadratic programming17
QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization17
Numerically tractable optimistic bilevel problems17
Randomized Kaczmarz methods for tensor complementarity problems14
A Riemannian rank-adaptive method for low-rank matrix completion14
Riemannian conjugate gradient methods with inverse retraction14
On mixed-integer optimal control with constrained total variation of the integer control14
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation13
Quantitative analysis for a class of two-stage stochastic linear variational inequality problems12
Sequential optimality conditions for cardinality-constrained optimization problems with applications12
Single-forward-step projective splitting: exploiting cocoercivity12
Convergence study of indefinite proximal ADMM with a relaxation factor12
Globalized inexact proximal Newton-type methods for nonconvex composite functions12
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces12
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization12
T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming12
Inexact restoration with subsampled trust-region methods for finite-sum minimization11
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates11
An augmented Lagrangian algorithm for multi-objective optimization11
A bundle method for nonsmooth DC programming with application to chance-constrained problems11
Globally convergent Newton-type methods for multiobjective optimization10
Exploiting term sparsity in noncommutative polynomial optimization10
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems10
Conditional gradient method for multiobjective optimization9
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems9
On a primal-dual Newton proximal method for convex quadratic programs9
On the convergence of steepest descent methods for multiobjective optimization9
The circumcentered-reflection method achieves better rates than alternating projections9
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization9
On the acceleration of the Barzilai–Borwein method9
The Pontryagin maximum principle for solving Fokker–Planck optimal control problems9
Hybrid Riemannian conjugate gradient methods with global convergence properties8
A note on solving nonlinear optimization problems in variable precision8
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization8
Quantitative results on a Halpern-type proximal point algorithm8
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem8
An Augmented Lagrangian method for quasi-equilibrium problems8
An explicit Tikhonov algorithm for nested variational inequalities8
Strengthened splitting methods for computing resolvents7
A two-level distributed algorithm for nonconvex constrained optimization7
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions7
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem7
Expected residual minimization method for monotone stochastic tensor complementarity problem7
A stochastic subspace approach to gradient-free optimization in high dimensions7
The Tikhonov regularization for vector equilibrium problems7
Accelerating incremental gradient optimization with curvature information7
A product space reformulation with reduced dimension for splitting algorithms7
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization7
Convergence rates of subgradient methods for quasi-convex optimization problems7
An inexact proximal generalized alternating direction method of multipliers6
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM6
Forward-reflected-backward method with variance reduction6
A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional6
Solving constrained nonsmooth group sparse optimization via group Capped-$$\ell _1$$ relaxation and group smoothing proximal gradient algorithm6
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems6
A modified proximal point method for DC functions on Hadamard manifolds6
An active-set algorithmic framework for non-convex optimization problems over the simplex6
MINLP formulations for continuous piecewise linear function fitting6
Inverse point source location with the Helmholtz equation on a bounded domain6
Gauss–Newton-type methods for bilevel optimization6
Oracle-based algorithms for binary two-stage robust optimization6
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems5
Fastest rates for stochastic mirror descent methods5
Convergence rates for an inexact ADMM applied to separable convex optimization5
The distance between convex sets with Minkowski sum structure: application to collision detection5
On the inexact scaled gradient projection method5
T-product factorization method for internet traffic data completion with spatio-temporal regularization5
An accelerated active-set algorithm for a quadratic semidefinite program with general constraints5
Bregman primal–dual first-order method and application to sparse semidefinite programming5
Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games5
An effective procedure for feature subset selection in logistic regression based on information criteria5
A proximal gradient method for control problems with non-smooth and non-convex control cost5
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming5
A smoothing proximal gradient algorithm for matrix rank minimization problem5
Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation5
Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$-controllers5
A general variable neighborhood search for the cyclic antibandwidth problem5
On the use of polynomial models in multiobjective directional direct search5
Secant Update generalized version of PSB: a new approach5
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints5
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems5
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials4
Polyhedral approximations of the semidefinite cone and their application4
Leveraging special-purpose hardware for local search heuristics4
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem4
Cartoon-texture evolution for two-region image segmentation4
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces4
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation4
Distributed forward-backward methods for ring networks4
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization4
Diagonal BFGS updates and applications to the limited memory BFGS method4
Make $$\ell _1$$ regularization effective in training sparse CNN4
Parametric shape optimization using the support function4
Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints4
Quadratic regularization methods with finite-difference gradient approximations4
On the tensor spectral p-norm and its dual norm via partitions4
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function4
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization4
On a numerical shape optimization approach for a class of free boundary problems4
A Laplacian approach to $$\ell _1$$-norm minimization4
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function4
0.027262926101685