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

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

Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization	10
The circumcentered-reflection method achieves better rates than alternating projections	10
A product space reformulation with reduced dimension for splitting algorithms	10
On the acceleration of the Barzilai–Borwein method	10
On the convergence of steepest descent methods for multiobjective optimization	10
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems	10
On a primal-dual Newton proximal method for convex quadratic programs	9
A two-level distributed algorithm for nonconvex constrained optimization	9
Conditional gradient method for multiobjective optimization	9
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem	9
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization	9
An explicit Tikhonov algorithm for nested variational inequalities	9
Forward-reflected-backward method with variance reduction	8
Quantitative results on a Halpern-type proximal point algorithm	8
Hybrid Riemannian conjugate gradient methods with global convergence properties	8
A note on solving nonlinear optimization problems in variable precision	8
A stochastic subspace approach to gradient-free optimization in high dimensions	8
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions	8
Expected residual minimization method for monotone stochastic tensor complementarity problem	7
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM	7
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem	7
An effective procedure for feature subset selection in logistic regression based on information criteria	7
Convergence rates of subgradient methods for quasi-convex optimization problems	7
Fastest rates for stochastic mirror descent methods	7
Strengthened splitting methods for computing resolvents	7
Solving constrained nonsmooth group sparse optimization via group Capped-$$\ell _1$$ relaxation and group smoothing proximal gradient algorithm	7
The Tikhonov regularization for vector equilibrium problems	7
Gauss–Newton-type methods for bilevel optimization	7
A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional	6
An active-set algorithmic framework for non-convex optimization problems over the simplex	6
Secant Update generalized version of PSB: a new approach	6
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems	6
A smoothing proximal gradient algorithm for matrix rank minimization problem	6
Constrained and unconstrained deep image prior optimization models with automatic regularization	6
Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$-controllers	6
Distributed forward-backward methods for ring networks	6
Oracle-based algorithms for binary two-stage robust optimization	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
Parametric shape optimization using the support function	6
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems	6
Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms	6
A proximal gradient method for control problems with non-smooth and non-convex control cost	6
An inexact proximal generalized alternating direction method of multipliers	6
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints	6
Inverse point source location with the Helmholtz equation on a bounded domain	6
On the use of polynomial models in multiobjective directional direct search	5
The distance between convex sets with Minkowski sum structure: application to collision detection	5
An adaptive trust-region method without function evaluations	5
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems	5

Optimal portfolio selections via $$\ell _{1, 2}$$-norm regularization	5
Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation	5
Convergence rates for an inexact ADMM applied to separable convex optimization	5
An accelerated proximal gradient method for multiobjective optimization	5
Leveraging special-purpose hardware for local search heuristics	5
On the inexact scaled gradient projection method	5
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems	5
An accelerated active-set algorithm for a quadratic semidefinite program with general constraints	5
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	5
Hybrid limited memory gradient projection methods for box-constrained optimization problems	5
A general variable neighborhood search for the cyclic antibandwidth problem	5
A limited memory Quasi-Newton approach for multi-objective optimization	5
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem	5
T-product factorization method for internet traffic data completion with spatio-temporal regularization	5
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method	5
Bregman primal–dual first-order method and application to sparse semidefinite programming	5
Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games	5
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function	4
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation	4
DC Semidefinite programming and cone constrained DC optimization I: theory	4
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function	4
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design	4
On a numerical shape optimization approach for a class of free boundary problems	4
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces	4
A Laplacian approach to $$\ell _1$$-norm minimization	4
A zeroth order method for stochastic weakly convex optimization	4
Quadratic regularization methods with finite-difference gradient approximations	4
Efficient differentiable quadratic programming layers: an ADMM approach	4
Make $$\ell _1$$ regularization effective in training sparse CNN	4
Diagonal BFGS updates and applications to the limited memory BFGS method	4
Expected complexity analysis of stochastic direct-search	4
An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem	4
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems	4
A random time-dependent noncooperative equilibrium problem	4
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials	4
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization	4
Cartoon-texture evolution for two-region image segmentation	4
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization	4
Polyhedral approximations of the semidefinite cone and their application	4
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations	4