OOIR: Observatory of International Research

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-07-01 to 2024-07-01.)

Article	Citations
Weak convergence of iterative methods for solving quasimonotone variational inequalities	85
Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods	47
Global optimization via inverse distance weighting and radial basis functions	34
An inexact accelerated stochastic ADMM for separable convex optimization	30
An interior point-proximal method of multipliers for convex quadratic programming	19
QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization	19
Riemannian conjugate gradient methods with inverse retraction	18
A Riemannian rank-adaptive method for low-rank matrix completion	18
Randomized Kaczmarz methods for tensor complementarity problems	17
On mixed-integer optimal control with constrained total variation of the integer control	16
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation	16
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization	15
T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming	15
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces	14
Globalized inexact proximal Newton-type methods for nonconvex composite functions	14
Sequential optimality conditions for cardinality-constrained optimization problems with applications	14
Single-forward-step projective splitting: exploiting cocoercivity	14
Exploiting term sparsity in noncommutative polynomial optimization	13
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates	13
Conditional gradient method for multiobjective optimization	12
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization	12
A bundle method for nonsmooth DC programming with application to chance-constrained problems	12
Globally convergent Newton-type methods for multiobjective optimization	12
On the acceleration of the Barzilai–Borwein method	11
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization	10

The circumcentered-reflection method achieves better rates than alternating projections	10
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization	10
Quantitative results on a Halpern-type proximal point algorithm	10
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems	10
A product space reformulation with reduced dimension for splitting algorithms	10
A two-level distributed algorithm for nonconvex constrained optimization	10
Hybrid Riemannian conjugate gradient methods with global convergence properties	9
An explicit Tikhonov algorithm for nested variational inequalities	9
On a primal-dual Newton proximal method for convex quadratic programs	9
Solving constrained nonsmooth group sparse optimization via group Capped-$$\ell _1$$ relaxation and group smoothing proximal gradient algorithm	9
Expected residual minimization method for monotone stochastic tensor complementarity problem	9
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem	9
A stochastic subspace approach to gradient-free optimization in high dimensions	8
Gauss–Newton-type methods for bilevel optimization	8
Constrained and unconstrained deep image prior optimization models with automatic regularization	7
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem	7
Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms	7
An accelerated proximal gradient method for multiobjective optimization	7
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM	7
The Tikhonov regularization for vector equilibrium problems	7
Forward-reflected-backward method with variance reduction	7
An effective procedure for feature subset selection in logistic regression based on information criteria	7
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions	7
Parametric shape optimization using the support function	7
Fastest rates for stochastic mirror descent methods	7
Strengthened splitting methods for computing resolvents	7
A limited memory Quasi-Newton approach for multi-objective optimization	7
A proximal gradient method for control problems with non-smooth and non-convex control cost	7
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems	6
On the use of polynomial models in multiobjective directional direct search	6
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems	6
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints	6
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method	6
A general variable neighborhood search for the cyclic antibandwidth problem	6
MINLP formulations for continuous piecewise linear function fitting	6
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming	6
Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$-controllers	6
Distributed forward-backward methods for ring networks	6
Secant Update generalized version of PSB: a new approach	6
A smoothing proximal gradient algorithm for matrix rank minimization problem	6
Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$-minimization problems	5
On the inexact scaled gradient projection method	5
T-product factorization method for internet traffic data completion with spatio-temporal regularization	5
An accelerated active-set algorithm for a quadratic semidefinite program with general constraints	5
Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation	5
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems	5
Inertial alternating direction method of multipliers for non-convex non-smooth optimization	5
Convergence rates for an inexact ADMM applied to separable convex optimization	5
Leveraging special-purpose hardware for local search heuristics	5
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem	5

An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem	5
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems	5
Quadratic regularization methods with finite-difference gradient approximations	5
Hybrid limited memory gradient projection methods for box-constrained optimization problems	5
Efficient differentiable quadratic programming layers: an ADMM approach	5
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	5
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization	5
An adaptive trust-region method without function evaluations	5
Expected complexity analysis of stochastic direct-search	5
Bregman primal–dual first-order method and application to sparse semidefinite programming	5
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials	5
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares	5
Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games	5
The distance between convex sets with Minkowski sum structure: application to collision detection	5
Derivative-free methods for mixed-integer nonsmooth constrained optimization	4
Cartoon-texture evolution for two-region image segmentation	4
On a numerical shape optimization approach for a class of free boundary problems	4
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations	4
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems	4
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation	4
Finite-sum smooth optimization with SARAH	4
Abstract strongly convergent variants of the proximal point algorithm	4
Make $$\ell _1$$ regularization effective in training sparse CNN	4
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design	4
Polyhedral approximations of the semidefinite cone and their application	4
Clustering-based multipopulation approaches in MOEA/D for many-objective problems	4
A zeroth order method for stochastic weakly convex optimization	4
Optimal portfolio selections via $$\ell _{1, 2}$$-norm regularization	4
Modeling design and control problems involving neural network surrogates	4
Low-rank factorization for rank minimization with nonconvex regularizers	4
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization	4
Diagonal BFGS updates and applications to the limited memory BFGS method	4
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces	4
A Laplacian approach to $$\ell _1$$-norm minimization	4
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function	4
A random time-dependent noncooperative equilibrium problem	4
DC Semidefinite programming and cone constrained DC optimization I: theory	4
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems	4