Computational Optimization and Applications

(The median citation count of Computational Optimization and Applications is 1. 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.)
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
QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization17
Numerically tractable optimistic bilevel problems17
An interior point-proximal method of multipliers for convex quadratic programming17
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
Randomized Kaczmarz methods for tensor complementarity problems14
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation13
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
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
A bundle method for nonsmooth DC programming with application to chance-constrained problems11
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
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems10
Globally convergent Newton-type methods for multiobjective optimization10
Exploiting term sparsity in noncommutative polynomial optimization10
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
Conditional gradient method for multiobjective optimization9
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems9
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
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
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
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
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
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 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
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
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function4
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials4
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
Polyhedral approximations of the semidefinite cone and their application4
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
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches3
An augmented subgradient method for minimizing nonsmooth DC functions3
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations3
A level set method for Laplacian eigenvalue optimization subject to geometric constraints3
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems3
A zeroth order method for stochastic weakly convex optimization3
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method3
Modeling design and control problems involving neural network surrogates3
Finite-sum smooth optimization with SARAH3
An accelerated proximal gradient method for multiobjective optimization3
On the interplay between acceleration and identification for the proximal gradient algorithm3
Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$-minimization problems3
A proximal-point outer approximation algorithm3
Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm3
An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem3
A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods3
A random time-dependent noncooperative equilibrium problem3
Newton-type methods near critical solutions of piecewise smooth nonlinear equations3
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems3
Optimal portfolio selections via $$\ell _{1, 2}$$-norm regularization3
Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations3
Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation3
A regularization method for constrained nonlinear least squares3
Derivative-free methods for mixed-integer nonsmooth constrained optimization3
Clustering-based multipopulation approaches in MOEA/D for many-objective problems3
Expected complexity analysis of stochastic direct-search3
A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function3
Hybrid limited memory gradient projection methods for box-constrained optimization problems3
A proximal DC approach for quadratic assignment problem3
Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms3
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse3
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs3
Subspace quadratic regularization method for group sparse multinomial logistic regression3
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design3
T-product factorization based method for matrix and tensor completion problems2
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients2
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm2
Constrained and unconstrained deep image prior optimization models with automatic regularization2
A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging2
The continuous stochastic gradient method: part I–convergence theory2
Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization2
Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC2
On the resolution of misspecified convex optimization and monotone variational inequality problems2
Efficient local search procedures for quadratic fractional programming problems2
On the properties of the cosine measure and the uniform angle subspace2
Branch-and-Model: a derivative-free global optimization algorithm2
A dual simplex-type algorithm for the smallest enclosing ball of balls2
On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems2
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions2
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization2
A data-driven approach for a class of stochastic dynamic optimization problems2
A path-following inexact Newton method for PDE-constrained optimal control in BV2
Generalizations of the proximal method of multipliers in convex optimization2
Block coordinate descent for smooth nonconvex constrained minimization2
On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction2
Properties of the delayed weighted gradient method2
Finding the global optimum of a class of quartic minimization problem2
An adaptive trust-region method without function evaluations2
Low-rank factorization for rank minimization with nonconvex regularizers2
A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties2
Generating set search using simplex gradients for bound-constrained black-box optimization2
On R-linear convergence analysis for a class of gradient methods2
Error estimates for the finite element approximation of bilinear boundary control problems2
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems2
Radius theorems for subregularity in infinite dimensions2
Minimization over the $$\ell _1$$-ball using an active-set non-monotone projected gradient2
Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification2
$${\text {B}}$$-subdifferentials of the projection onto the matrix simplex2
Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms2
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers2
Conic formulation of QPCCs applied to truly sparse QPs2
From inexact optimization to learning via gradient concentration2
A differentiable path-following algorithm for computing perfect stationary points2
Matrix optimization based Euclidean embedding with outliers2
A piecewise conservative method for unconstrained convex optimization1
On solving a class of fractional semi-infinite polynomial programming problems1
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities1
Preface to the special issue on optimization with polynomials and tensors1
An alternate approach to solve two-level priority based assignment problem1
General-purpose preconditioning for regularized interior point methods1
A generalized shortest path tour problem with time windows1
DC Semidefinite programming and cone constrained DC optimization I: theory1
On the solution stability of parabolic optimal control problems1
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique1
Inertial alternating direction method of multipliers for non-convex non-smooth optimization1
Using partial spectral information for block diagonal preconditioning of saddle-point systems1
Accelerated inexact composite gradient methods for nonconvex spectral optimization problems1
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction1
A branch-and-prune algorithm for discrete Nash equilibrium problems1
Alternating conditional gradient method for convex feasibility problems1
Second order semi-smooth Proximal Newton methods in Hilbert spaces1
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions1
Extension of switch point algorithm to boundary-value problems1
Composite convex optimization with global and local inexact oracles1
$$\rho$$-regularization subproblems: strong duality and an eigensolver-based algorithm1
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space1
A communication-efficient and privacy-aware distributed algorithm for sparse PCA1
SDP-based bounds for graph partition via extended ADMM1
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint1
First order inertial optimization algorithms with threshold effects associated with dry friction1
Inexact gradient projection method with relative error tolerance1
Efficient differentiable quadratic programming layers: an ADMM approach1
Two new bidirectional search algorithms1
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines1
The deepest event cuts in risk-averse optimization with application to radiation therapy design1
A sublevel moment-SOS hierarchy for polynomial optimization1
Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton’s equation1
Robust and continuous metric subregularity for linear inequality systems1
New Bregman proximal type algorithms for solving DC optimization problems1
Simple approximative algorithms for free-support Wasserstein barycenters1
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems1
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems1
A limited memory Quasi-Newton approach for multi-objective optimization1
Tensor Z-eigenvalue complementarity problems1
On global convergence of alternating least squares for tensor approximation1
Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition1
Optimality conditions for Tucker low-rank tensor optimization1
Spectral conjugate gradient methods for vector optimization problems1
Two methods for the maximization of homogeneous polynomials over the simplex1
A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE1
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization1
Multiobjective BFGS method for optimization on Riemannian manifolds1
A study of progressive hedging for stochastic integer programming1
A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ regularization problem1
A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure1
Implementing and modifying Broyden class updates for large scale optimization1
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming1
A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions1
Quantifying uncertainty with ensembles of surrogates for blackbox optimization1
A parallel splitting ALM-based algorithm for separable convex programming1
Minimum cost b-matching problems with neighborhoods1
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares1
A nested primal–dual FISTA-like scheme for composite convex optimization problems1
Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints1
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations1
Nonconvex robust programming via value-function optimization1
Abstract strongly convergent variants of the proximal point algorithm1
A harmonic framework for stepsize selection in gradient methods1
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems1
An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function1
OFFO minimization algorithms for second-order optimality and their complexity1
Robust min-max regret covering problems1
Accelerated gradient sliding for structured convex optimization1