Computational Optimization and Applications

Article	Citations
Special issue for SIMAI 2020–2021: large-scale optimization and applications	46
A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems	27
Alternating conditional gradient method for convex feasibility problems	26
An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints	26
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations	23
Generating representative sets for multiobjective discrete optimization problems with specified coverage errors	22
Adaptive dipole-like parameter calibration of complex black-box continuous processes	19
A nonsmooth primal-dual method with interwoven PDE constraint solver	19
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints	19
Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective	19
Average curvature FISTA for nonconvex smooth composite optimization problems	18
Parametric shape optimization using the support function	17
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities	15
A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions	15
Constrained and unconstrained deep image prior optimization models with automatic regularization	15
Sequential optimality conditions for cardinality-constrained optimization problems with applications	14
Derivative-free methods for mixed-integer nonsmooth constrained optimization	14
A space–time variational method for optimal control problems: well-posedness, stability and numerical solution	14
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions	13
An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems	12
Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints	12
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems	12
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function	12
Strong global convergence properties of algorithms for nonlinear symmetric cone programming	12
Subspace quadratic regularization method for group sparse multinomial logistic regression	12

Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms	11
Two limited-memory optimization methods with minimum violation of the previous secant conditions	11
A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials	10
Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids	10
Full-low evaluation methods for bound and linearly constrained derivative-free optimization	10
Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions	10
Adversarial perturbations of physical signals	10
An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems	10
The continuous stochastic gradient method: part I–convergence theory	10
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines	9
Inertial alternating direction method of multipliers for non-convex non-smooth optimization	9
Modeling design and control problems involving neural network surrogates	9
An effective procedure for feature subset selection in logistic regression based on information criteria	9
Quantifying uncertainty with ensembles of surrogates for blackbox optimization	9
Distributed stochastic compositional optimization problems over directed networks	8
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation	8
A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor	8
A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization	8
Correction to: The continuous stochastic gradient method: part II–application and numerics	8
Error estimates for Runge–Kutta schemes of optimal control problems with index 1 DAEs	8
A randomized feasible algorithm for optimization with orthogonal constraints	8
A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity	8
Strengthened splitting methods for computing resolvents	8
Accelerated forward–backward algorithms for structured monotone inclusions	7
Second order shape optimization for an interface identification problem constrained by nonlocal models	7
A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties	7
Cardinality constrained mean-variance portfolios: a penalty decomposition algorithm	7
Bregman primal–dual first-order method and application to sparse semidefinite programming	7
Newton-type methods near critical solutions of piecewise smooth nonlinear equations	7
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints	7
Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming	7
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I	7
Eigenvalue programming beyond matrices	7
An inexact Riemannian proximal gradient method	7
A distributed algorithm for high-dimension convex quadratically constrained quadratic programs	7
The continuous stochastic gradient method: part II–application and numerics	7
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization	7
Local convergence of primal–dual interior point methods for nonlinear semidefinite optimization using the Monteiro–Tsuchiya family of search directions	7
Recycling basic columns of the splitting preconditioner in interior point methods	6
Correction: A Bregman–Kaczmarz method for nonlinear systems of equations	6
Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization	6
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space	6
A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems	6
Inexact log-domain interior-point methods for quadratic programming	6
Proximal-stabilized semidefinite programming	6
T-product factorization method for internet traffic data completion with spatio-temporal regularization	6
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches	6
Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing	6
A nested primal–dual iterated Tikhonov method for regularized convex optimization	6
COAP 2020 best paper prize	5

Leveraging special-purpose hardware for local search heuristics	5
Simple approximative algorithms for free-support Wasserstein barycenters	5
Understanding the Douglas–Rachford splitting method through the lenses of Moreau-type envelopes	5
Distribution-free algorithms for predictive stochastic programming in the presence of streaming data	5
An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization	5
An adaptive trust-region method without function evaluations	5
Stochastic projective splitting	5
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems	5
A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints	5
Value of risk aversion in perishable products supply chain management	5
On the solution stability of parabolic optimal control problems	5
On the inexact scaled gradient projection method	5
An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems	5
Multiobjective BFGS method for optimization on Riemannian manifolds	5
SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization	5
From inexact optimization to learning via gradient concentration	5
Branch-and-Model: a derivative-free global optimization algorithm	5
Ultra-small world detection in networks: subgraphs with prescribed distance distributions	4
On the acceleration of the Barzilai–Borwein method	4
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems	4
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization	4
A two-level distributed algorithm for nonconvex constrained optimization	4
Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC	4
A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares	4
Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization	4
Randomized Kaczmarz methods for tensor complementarity problems	4
Efficient differentiable quadratic programming layers: an ADMM approach	4
DC Semidefinite programming and cone constrained DC optimization I: theory	4
A trust-region approach for computing Pareto fronts in multiobjective optimization	4
Stochastic Steffensen method	4
A note on the convergence of deterministic gradient sampling in nonsmooth optimization	4
Quadratic convex reformulations for a class of complex quadratic programming problems	4
An accelerated proximal gradient method for multiobjective optimization	4
Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition	4
DC semidefinite programming and cone constrained DC optimization II: local search methods	4
Optimal portfolio selections via $$\ell _{1, 2}$$-norm regularization	4
On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems	4
An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule	4
COAP 2021 Best Paper Prize	3
The Levenberg–Marquardt method: an overview of modern convergence theories and more	3
A flexible gradient tracking algorithmic framework for decentralized optimization	3
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	3
A stochastic moving ball approximation method for smooth convex constrained minimization	3
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation	3
Minimum cost b-matching problems with neighborhoods	3
COAP 2022 Best Paper Prize	3
Optimization over the Pareto front of nonconvex multi-objective optimal control problems	3
A symmetric version of the generalized Chambolle-Pock-He-Yuan method for saddle point problems	3
A second-order sequential optimality condition for nonlinear second-order cone programming problems	3
A subgradient method with non-monotone line search	3
A Bregman–Kaczmarz method for nonlinear systems of equations	3
A general variable neighborhood search for the cyclic antibandwidth problem	3
MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization	3
An away-step Frank–Wolfe algorithm for constrained multiobjective optimization	3
A generalized shortest path tour problem with time windows	3
Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming	3
Extension of switch point algorithm to boundary-value problems	3
All saddle points for polynomial optimization	3
The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results	3
Speeding up L-BFGS by direct approximation of the inverse Hessian matrix	3
On initial point selection of the steepest descent algorithm for general quadratic functions	3
Distributed forward-backward methods for ring networks	3
Distributionally robust Weber problem with uncertain demand	3
Spectral analysis of block preconditioners for double saddle-point linear systems with application to PDE-constrained optimization	3
Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$-controllers	3
A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles	3
A general framework for whiteness-based parameters selection in variational models	3
Expected complexity analysis of stochastic direct-search	3
Extragradient method with feasible inexact projection to variational inequality problem	3
Forward-reflected-backward method with variance reduction	3
An arc-search interior-point algorithm for nonlinear constrained optimization	3
Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS	3
Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization	2
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares	2
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique	2
Efficient proximal subproblem solvers for a nonsmooth trust-region method	2
Globally optimal univariate spline approximations	2
Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension	2
On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination	2
A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks	2

A generalized alternating direction method of multipliers for tensor complementarity problems	2
Linearly convergent bilevel optimization with single-step inner methods	2
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization	2
A branch-and-prune algorithm for discrete Nash equilibrium problems	2
$$\rho$$-regularization subproblems: strong duality and an eigensolver-based algorithm	2
A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations	2
First order inertial optimization algorithms with threshold effects associated with dry friction	2
Stochastic average model methods	2
SCORE: approximating curvature information under self-concordant regularization	2
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method	2
Abstract strongly convergent variants of the proximal point algorithm	2
A sublevel moment-SOS hierarchy for polynomial optimization	2
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems	2
On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization	2
A new proximal heavy ball inexact line-search algorithm	2
Finite-sum smooth optimization with SARAH	2
Inexact penalty decomposition methods for optimization problems with geometric constraints	2
Spectral stochastic gradient method with additional sampling for finite and infinite sums	2
Globally convergent Newton-type methods for multiobjective optimization	2
A Riemannian rank-adaptive method for low-rank matrix completion	2
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming	2
Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm	2
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers	2
Integer set reduction for stochastic mixed-integer programming	2
Practical gradient and conjugate gradient methods on flag manifolds	2
Finding best approximation pairs for two intersections of closed convex sets	2
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming	2
Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization	2
A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation	2
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems	2
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse	2
A unified approach for smoothing approximations to the exact $$\ell _1$$-penalty for inequality-constrained optimization	2
Preface to special issue on “optimal control of nonlinear differential equations”	2
A stochastic primal-dual method for a class of nonconvex constrained optimization	1
Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations	1
Inexact proximal Newton methods in Hilbert spaces	1
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients	1
Convergence rate estimates for penalty methods revisited	1
Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an Augmented Lagrangian method	1
Inexact gradient projection method with relative error tolerance	1
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II	1
A smoothing proximal gradient algorithm for matrix rank minimization problem	1
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming	1
Handling of constraints in multiobjective blackbox optimization	1
Two-commodity opposite direction network flow formulations for the travelling salesman problem	1
GLISp-r: a preference-based optimization algorithm with convergence guarantees	1
Clustering-based multipopulation approaches in MOEA/D for many-objective problems	1
A convex combined symmetric alternating direction method of multipliers for separable optimization	1
Block coordinate descent for smooth nonconvex constrained minimization	1
Riemannian optimization on unit sphere with p-norm and its applications	1
Preface: New trends in large scale optimization	1
A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint	1
Two methods for the maximization of homogeneous polynomials over the simplex	1
Optimal control of the stationary Kirchhoff equation	1
A proximal gradient method for control problems with non-smooth and non-convex control cost	1
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound	1
Solving continuous and discrete nonlinear programs with BARON	1
On a primal-dual Newton proximal method for convex quadratic programs	1
T-product factorization based method for matrix and tensor completion problems	1
On a minimization problem of the maximum generalized eigenvalue: properties and algorithms	1
Radius theorems for subregularity in infinite dimensions	1
A product space reformulation with reduced dimension for splitting algorithms	1
Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification	1
A new and faster representation for counting integer points in parametric polyhedra	1
Robust min-max regret covering problems	1
An inexact ADMM for separable nonconvex and nonsmooth optimization	1
A new technique to derive tight convex underestimators (sometimes envelopes)	1
Improving the stochastically controlled stochastic gradient method by the bandwidth-based stepsize	1
Preface to the 5th Brazil–China Symposium on Applied and Computational Mathematics	1
Exploiting term sparsity in noncommutative polynomial optimization	1
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications	1
Distributed inexact Newton method with adaptive step sizes	1
Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm	1
Robust and continuous metric subregularity for linear inequality systems	1
A projected-search interior-point method for nonlinearly constrained optimization	1
Correction to: Parametric shape optimization using the support function	1
Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization	1
The indefinite proximal gradient method	1
A non-monotone trust-region method with noisy oracles and additional sampling	1
A data-driven approach for a class of stochastic dynamic optimization problems	1
A two-stage stochastic programming approach for generation and transmission maintenance scheduling with risk management	1
A successive centralized circumcentered-reflection method for the convex feasibility problem	1
A communication-efficient and privacy-aware distributed algorithm for sparse PCA	1
An augmented subgradient method for minimizing nonsmooth DC functions	1
Approximate bregman proximal gradient algorithm for relatively smooth nonconvex optimization	1
New Bregman proximal type algorithms for solving DC optimization problems	1
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design	1
COAP 2023 best paper prize	1
A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ regularization problem	1
Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm	1
Hybrid limited memory gradient projection methods for box-constrained optimization problems	1
A benchmark generator for scenario-based discrete optimization	1
Avoiding bad steps in Frank-Wolfe variants	1
Diagonal BFGS updates and applications to the limited memory BFGS method	1
An inexact regularized proximal Newton method without line search	1