Computational Optimization and Applications

Article	Citations
Convergence rate estimates for penalty methods revisited	43
Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing	24
Regularized standard polynomial programming formulations for the maximum clique problem	23
Special issue for SIMAI 2020–2021: large-scale optimization and applications	22
Optimality conditions for Tucker low-rank tensor optimization	21
COAP 2022 Best Paper Prize	20
A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems	19
A general framework for whiteness-based parameters selection in variational models	17
A nested primal–dual iterated Tikhonov method for regularized convex optimization	17
A nonsmooth primal-dual method with interwoven PDE constraint solver	16
Handling of constraints in multiobjective blackbox optimization	15
A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems	15
A successive centralized circumcentered-reflection method for the convex feasibility problem	14
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations	13
Lifted stationary points of sparse optimization with complementarity constraints	13
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces	13
T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization	12
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations	12
T-product factorization based method for matrix and tensor completion problems	12
T-product factorization method for internet traffic data completion with spatio-temporal regularization	11
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation	11
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming	11
Clustering-based multipopulation approaches in MOEA/D for many-objective problems	11
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space	11
Alternating conditional gradient method for convex feasibility problems	10

The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results	10
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences	10
“FISTA” in Banach spaces with adaptive discretisations	10
Radius theorems for subregularity in infinite dimensions	9
Expected complexity analysis of stochastic direct-search	9
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches	9
Correction: A Bregman–Kaczmarz method for nonlinear systems of equations	9
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints	9
A data-driven approach for a class of stochastic dynamic optimization problems	9
Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems	9
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM	9
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction	8
Eigenvalue programming beyond matrices	8
Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization	8
An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints	8
Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm	8
A hybrid inexact regularized Newton and negative curvature method	8
A smoothing proximal gradient algorithm for matrix rank minimization problem	8
A nested primal–dual FISTA-like scheme for composite convex optimization problems	8
Internet traffic tensor completion with tensor nuclear norm	8
Local convergence of primal–dual interior point methods for nonlinear semidefinite optimization using the Monteiro–Tsuchiya family of search directions	7
Generating representative sets for multiobjective discrete optimization problems with specified coverage errors	7
Inexact log-domain interior-point methods for quadratic programming	7
Projected fixed-point method for vertical tensor complementarity problems	7
An abstract convergence framework with application to inertial inexact forward–backward methods	7
Loss functions for finite sets	7
A harmonic framework for stepsize selection in gradient methods	7
Coordinate descent methods beyond smoothness and separability	7
Proximal-stabilized semidefinite programming	7
Extension of switch point algorithm to boundary-value problems	7
OFFO minimization algorithms for second-order optimality and their complexity	7
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions	7
Recycling basic columns of the splitting preconditioner in interior point methods	7
Nonsmooth projection-free optimization with functional constraints	7
Extragradient method with feasible inexact projection to variational inequality problem	7
Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective	7
A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems	7
Simple approximative algorithms for free-support Wasserstein barycenters	7
Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier–Stokes equations with surface tension	6
Cardinality constrained mean-variance portfolios: a penalty decomposition algorithm	6
Constrained and unconstrained deep image prior optimization models with automatic regularization	6
Regularized methods via cubic model subspace minimization for nonconvex optimization	6
Correction to: Stochastic projective splitting	6
Convergence of successive linear programming algorithms for noisy functions	6
All saddle points for polynomial optimization	6
On the well-posedness of tracking Dirichlet data for Bernoulli free boundary problems	6
Average curvature FISTA for nonconvex smooth composite optimization problems	5
Understanding the Douglas–Rachford splitting method through the lenses of Moreau-type envelopes	5
Convergence of a stochastic variance reduced Levenberg–Marquardt method	5
An augmented subgradient method for minimizing nonsmooth DC functions	5

A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems	5
Rank-one approximation of a higher-order tensor by a Riemannian trust-region method	5
A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization	5
Parametric shape optimization using the support function	5
An inexact ADMM for separable nonconvex and nonsmooth optimization	5
Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization	5
Robust and continuous metric subregularity for linear inequality systems	4
A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem	4
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint	4
A Scaled Gradient Projection method for the realization of the balancing principle in TGV-based image restoration	4
Two new bidirectional search algorithms	4
Sequential optimality conditions for cardinality-constrained optimization problems with applications	4
A split Levenberg-Marquardt method for large-scale sparse problems	4
A generalized shortest path tour problem with time windows	4
Efficiency of higher-order algorithms for minimizing composite functions	4
On the inexact scaled gradient projection method	4
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities	4
A dual simplex-type algorithm for the smallest enclosing ball of balls	4
Multiobjective BFGS method for optimization on Riemannian manifolds	4
Correction: Robust approximation of chance constrained optimization with polynomial perturbation	4
An alternate approach to solve two-level priority based assignment problem	4
Minimum cost b-matching problems with neighborhoods	4
From inexact optimization to learning via gradient concentration	4
The deepest event cuts in risk-averse optimization with application to radiation therapy design	4
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem	4
A proximal gradient method for control problems with non-smooth and non-convex control cost	4
On solving difference of convex functions programs with linear complementarity constraints	4
A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients	4
A reduced proximal-point homotopy method for large-scale non-convex BQP	4
A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations	3
Derivative-free methods for mixed-integer nonsmooth constrained optimization	3
Value of risk aversion in perishable products supply chain management	3
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design	3
Truncated LSQR for matrix least squares problems	3
A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints	3
Finding the global optimum of a class of quartic minimization problem	3
SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization	3
Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems	3
A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions	3
A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ regularization problem	3
Inexact proximal DC Newton-type method for nonconvex composite functions	3
Cartoon-texture evolution for two-region image segmentation	3
A boosted DC algorithm for non-differentiable DC components with non-monotone line search	3
A Riemannian rank-adaptive method for low-rank matrix completion	3
Distribution-free algorithms for predictive stochastic programming in the presence of streaming data	3
A stochastic moving ball approximation method for smooth convex constrained minimization	3
Branch-and-Model: a derivative-free global optimization algorithm	3
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems	3
Conic formulation of QPCCs applied to truly sparse QPs	3
Low-rank factorization for rank minimization with nonconvex regularizers	3
Inexact gradient projection method with relative error tolerance	3
Robust approximation of chance constrained optimization with polynomial perturbation	3
Globally convergent Newton-type methods for multiobjective optimization	3
Diagonal BFGS updates and applications to the limited memory BFGS method	3
A space–time variational method for optimal control problems: well-posedness, stability and numerical solution	3
On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems	3
An adaptive trust-region method without function evaluations	3
Practical gradient and conjugate gradient methods on flag manifolds	3
The weighted Euclidean one-center problem in $${\mathbb {R}}^n$$	3
An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization	3
On the solution stability of parabolic optimal control problems	3
Abstract strongly convergent variants of the proximal point algorithm	2
Shape optimization for interface identification in nonlocal models	2
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs	2
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem	2
Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC	2
Compact representations of structured BFGS matrices	2
A branch-and-prune algorithm for discrete Nash equilibrium problems	2
A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares	2
Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming	2
Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton–Krylov methods	2
Iterative regularization for constrained minimization formulations of nonlinear inverse problems	2
Subspace quadratic regularization method for group sparse multinomial logistic regression	2
A limited memory Quasi-Newton approach for multi-objective optimization	2
Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones	2
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers	2
On FISTA with a relative error rule	2
Shortest path with acceleration constraints: complexity and approximation algorithms	2
Randomized Kaczmarz methods for tensor complementarity problems	2
Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints	2

Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm	2
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function	2
Design of a heuristic algorithm for the generalized multi-objective set covering problem	2
Spectral stochastic gradient method with additional sampling for finite and infinite sums	2
Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2)	2
An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems	2
$$\rho$$-regularization subproblems: strong duality and an eigensolver-based algorithm	2
An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems	2
Stochastic projective splitting	2
Dynamic stochastic projection method for multistage stochastic variational inequalities	2
Solving constrained nonsmooth group sparse optimization via group Capped-$$\ell _1$$ relaxation and group smoothing proximal gradient algorithm	2
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions	2
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems	2
A piecewise conservative method for unconstrained convex optimization	2
Two methods for the maximization of homogeneous polynomials over the simplex	2
Stochastic Steffensen method	2
Leveraging special-purpose hardware for local search heuristics	2
Strong global convergence properties of algorithms for nonlinear symmetric cone programming	2
Ultra-small world detection in networks: subgraphs with prescribed distance distributions	2
COAP 2020 best paper prize	2
Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes	2
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints	2
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems	2
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization	1
Integer set reduction for stochastic mixed-integer programming	1
Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints	1
On solving a class of fractional semi-infinite polynomial programming problems	1
An accelerated proximal gradient method for multiobjective optimization	1
The continuous stochastic gradient method: part I–convergence theory	1
Stochastic average model methods	1
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming	1
On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction	1
New Bregman proximal type algorithms for solving DC optimization problems	1
Finite-sum smooth optimization with SARAH	1
Inertial alternating direction method of multipliers for non-convex non-smooth optimization	1
Efficient proximal subproblem solvers for a nonsmooth trust-region method	1
GLISp-r: a preference-based optimization algorithm with convergence guarantees	1
A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials	1
A sublevel moment-SOS hierarchy for polynomial optimization	1
A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE	1
Local saddle points for unconstrained polynomial optimization	1
DC semidefinite programming and cone constrained DC optimization II: local search methods	1
A third-order weighted essentially non-oscillatory scheme in optimal control problems governed by nonlinear hyperbolic conservation laws	1
A communication-efficient and privacy-aware distributed algorithm for sparse PCA	1
Correction to: Globalized inexact proximal Newton-type methods for nonconvex composite functions	1
An effective procedure for feature subset selection in logistic regression based on information criteria	1
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization	1
On large-scale unconstrained optimization and arbitrary regularization	1
Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients	1
SDP-based bounds for graph partition via extended ADMM	1
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique	1
SCORE: approximating curvature information under self-concordant regularization	1
Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition	1
Correction to: Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization	1
First order inertial optimization algorithms with threshold effects associated with dry friction	1
Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems	1
Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations	1
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares	1
An inexact accelerated stochastic ADMM for separable convex optimization	1
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems	1
Distributed Tikhonov regularization for ill-posed inverse problems from a Bayesian perspective	1
Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension	1
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	1
The circumcentered-reflection method achieves better rates than alternating projections	1
Efficient scalarization in multiobjective optimal control of a nonsmooth PDE	1
A note on the convergence of deterministic gradient sampling in nonsmooth optimization	1
Two limited-memory optimization methods with minimum violation of the previous secant conditions	1
Adversarial perturbations of physical signals	1
A parallel splitting ALM-based algorithm for separable convex programming	1
$${\text {B}}$$-subdifferentials of the projection onto the matrix simplex	1
Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization	1
Generalizations of the proximal method of multipliers in convex optimization	1
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization	1
Inertial accelerated stochastic mirror descent for large-scale generalized tensor CP decomposition	1
Full-low evaluation methods for bound and linearly constrained derivative-free optimization	1
Preface to special issue on “optimal control of nonlinear differential equations”	1
Inexact penalty decomposition methods for optimization problems with geometric constraints	1
Quadratic convex reformulations for a class of complex quadratic programming problems	1
A two-level distributed algorithm for nonconvex constrained optimization	1
An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function	1
On the acceleration of the Barzilai–Borwein method	1
Approximate bregman proximal gradient algorithm for relatively smooth nonconvex optimization	1
Accelerated gradient sliding for structured convex optimization	1
Efficient differentiable quadratic programming layers: an ADMM approach	1