Computational Optimization and Applications

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

The Pontryagin maximum principle for solving Fokker–Planck optimal control problems	10
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems	10
Globally convergent Newton-type methods for multiobjective optimization	10
The circumcentered-reflection method achieves better rates than alternating projections	9
On a primal-dual Newton proximal method for convex quadratic programs	9
On the convergence of steepest descent methods for multiobjective optimization	9
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems	9
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization	9
On the acceleration of the Barzilai–Borwein method	9
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization	9
Conditional gradient method for multiobjective optimization	9
A note on solving nonlinear optimization problems in variable precision	8
Hybrid Riemannian conjugate gradient methods with global convergence properties	8
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem	8
Quantitative results on a Halpern-type proximal point algorithm	8
An explicit Tikhonov algorithm for nested variational inequalities	8
Accelerating incremental gradient optimization with curvature information	7
A product space reformulation with reduced dimension for splitting algorithms	7
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization	7
The Tikhonov regularization for vector equilibrium problems	7
Forward-reflected-backward method with variance reduction	7
Strengthened splitting methods for computing resolvents	7
A two-level distributed algorithm for nonconvex constrained optimization	7
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions	7
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem	7
Expected residual minimization method for monotone stochastic tensor complementarity problem	7
A stochastic subspace approach to gradient-free optimization in high dimensions	7
Convergence rates of subgradient methods for quasi-convex optimization problems	7
Oracle-based algorithms for binary two-stage robust optimization	6
A proximal gradient method for control problems with non-smooth and non-convex control cost	6
MINLP formulations for continuous piecewise linear function fitting	6
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints	6
Gauss–Newton-type methods for bilevel optimization	6
A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional	6
Solving constrained nonsmooth group sparse optimization via group Capped-$$\ell _1$$ relaxation and group smoothing proximal gradient algorithm	6
An inexact proximal generalized alternating direction method of multipliers	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
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
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM	6
Fastest rates for stochastic mirror descent methods	6
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems	6
Bregman primal–dual first-order method and application to sparse semidefinite programming	5
A general variable neighborhood search for the cyclic antibandwidth problem	5
Convergence rates for an inexact ADMM applied to separable convex optimization	5
An accelerated proximal gradient method for multiobjective optimization	5
Parametric shape optimization using the support function	5
Inverse point source location with the Helmholtz equation on a bounded domain	5

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation	5
Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms	5
An effective procedure for feature subset selection in logistic regression based on information criteria	5
The distance between convex sets with Minkowski sum structure: application to collision detection	5
A smoothing proximal gradient algorithm for matrix rank minimization problem	5
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems	5
An accelerated active-set algorithm for a quadratic semidefinite program with general constraints	5
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems	5
Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games	5
On the use of polynomial models in multiobjective directional direct search	5
On the inexact scaled gradient projection method	5
T-product factorization method for internet traffic data completion with spatio-temporal regularization	5
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems	4
Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints	4
Quadratic regularization methods with finite-difference gradient approximations	4
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	4
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function	4
Diagonal BFGS updates and applications to the limited memory BFGS method	4
Make $$\ell _1$$ regularization effective in training sparse CNN	4
Polyhedral approximations of the semidefinite cone and their application	4
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function	4
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method	4
A Laplacian approach to $$\ell _1$$-norm minimization	4
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials	4
Leveraging special-purpose hardware for local search heuristics	4
An adaptive trust-region method without function evaluations	4
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization	4
Constrained and unconstrained deep image prior optimization models with automatic regularization	4
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces	4
A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function	4
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation	4
Distributed forward-backward methods for ring networks	4
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization	4
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem	4
Cartoon-texture evolution for two-region image segmentation	4
On a numerical shape optimization approach for a class of free boundary problems	4
Hybrid limited memory gradient projection methods for box-constrained optimization problems	3
A zeroth order method for stochastic weakly convex optimization	3
Modeling design and control problems involving neural network surrogates	3
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse	3
Block coordinate descent for smooth nonconvex constrained minimization	3
Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms	3
On the interplay between acceleration and identification for the proximal gradient algorithm	3
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design	3
Clustering-based multipopulation approaches in MOEA/D for many-objective problems	3
Expected complexity analysis of stochastic direct-search	3
Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm	3
A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties	3
Newton-type methods near critical solutions of piecewise smooth nonlinear equations	3
A random time-dependent noncooperative equilibrium problem	3
Optimal portfolio selections via $$\ell _{1, 2}$$-norm regularization	3
Finite-sum smooth optimization with SARAH	3
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems	3
Subspace quadratic regularization method for group sparse multinomial logistic regression	3
Branch-and-Model: a derivative-free global optimization algorithm	3
Derivative-free methods for mixed-integer nonsmooth constrained optimization	3
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches	3
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations	3
An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem	3
A level set method for Laplacian eigenvalue optimization subject to geometric constraints	3
A proximal DC approach for quadratic assignment problem	3
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems	3
$${\text {B}}$$-subdifferentials of the projection onto the matrix simplex	3
Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations	3
On the resolution of misspecified convex optimization and monotone variational inequality problems	3
Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation	3
A regularization method for constrained nonlinear least squares	3
Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$-minimization problems	3
An augmented subgradient method for minimizing nonsmooth DC functions	3
A proximal-point outer approximation algorithm	3
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm	2
A path-following inexact Newton method for PDE-constrained optimal control in BV	2
Quantifying uncertainty with ensembles of surrogates for blackbox optimization	2
Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization	2
A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE	2
Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC	2
An alternate approach to solve two-level priority based assignment problem	2
An inexact Riemannian proximal gradient method	2
From inexact optimization to learning via gradient concentration	2
On R-linear convergence analysis for a class of gradient methods	2

Sub-linear convergence of a stochastic proximal iteration method in Hilbert space	2
Radius theorems for subregularity in infinite dimensions	2
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization	2
Minimization over the $$\ell _1$$-ball using an active-set non-monotone projected gradient	2
The continuous stochastic gradient method: part I–convergence theory	2
Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition	2
On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction	2
Properties of the delayed weighted gradient method	2
Finding the global optimum of a class of quartic minimization problem	2
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients	2
A dual simplex-type algorithm for the smallest enclosing ball of balls	2
Matrix optimization based Euclidean embedding with outliers	2
T-product factorization based method for matrix and tensor completion problems	2
A data-driven approach for a class of stochastic dynamic optimization problems	2
An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems	2
A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions	2
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares	2
Generalizations of the proximal method of multipliers in convex optimization	2
Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints	2
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers	2
Low-rank factorization for rank minimization with nonconvex regularizers	2
Optimization over the Pareto front of nonconvex multi-objective optimal control problems	2
Conic formulation of QPCCs applied to truly sparse QPs	2
On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems	2
On the properties of the cosine measure and the uniform angle subspace	2
Avoiding bad steps in Frank-Wolfe variants	2
Generating set search using simplex gradients for bound-constrained black-box optimization	2
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions	2
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems	1
Two new bidirectional search algorithms	1
The deepest event cuts in risk-averse optimization with application to radiation therapy design	1
Efficient differentiable quadratic programming layers: an ADMM approach	1
Robust and continuous metric subregularity for linear inequality systems	1
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines	1
Alternating conditional gradient method for convex feasibility problems	1
A communication-efficient and privacy-aware distributed algorithm for sparse PCA	1
Extension of switch point algorithm to boundary-value problems	1
Inertial alternating direction method of multipliers for non-convex non-smooth optimization	1
A sublevel moment-SOS hierarchy for polynomial optimization	1
Tensor Z-eigenvalue complementarity problems	1
Greedy PSB methods with explicit superlinear convergence	1
Abstract strongly convergent variants of the proximal point algorithm	1
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations	1
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications	1
An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function	1
Second order semi-smooth Proximal Newton methods in Hilbert spaces	1
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions	1
Spectral conjugate gradient methods for vector optimization problems	1
Multiobjective BFGS method for optimization on Riemannian manifolds	1
First order inertial optimization algorithms with threshold effects associated with dry friction	1
Inexact gradient projection method with relative error tolerance	1
A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure	1
Implementing and modifying Broyden class updates for large scale optimization	1
A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions	1
Robust min-max regret covering problems	1
Minimum cost b-matching problems with neighborhoods	1
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming	1
A nested primal–dual FISTA-like scheme for composite convex optimization problems	1
Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton’s equation	1
Optimality conditions for Tucker low-rank tensor optimization	1
New Bregman proximal type algorithms for solving DC optimization problems	1
Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension	1
Using partial spectral information for block diagonal preconditioning of saddle-point systems	1
Finding multi-objective supported efficient spanning trees	1
$$\rho$$-regularization subproblems: strong duality and an eigensolver-based algorithm	1
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems	1
Linear singularly perturbed systems without slow-fast split	1
A limited memory Quasi-Newton approach for multi-objective optimization	1
On global convergence of alternating least squares for tensor approximation	1
Two methods for the maximization of homogeneous polynomials over the simplex	1
On solving a class of fractional semi-infinite polynomial programming problems	1
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint	1
A study of progressive hedging for stochastic integer programming	1
A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ regularization problem	1
A generalized shortest path tour problem with time windows	1
Preface to the special issue on optimization with polynomials and tensors	1
On the solution stability of parabolic optimal control problems	1
General-purpose preconditioning for regularized interior point methods	1
Simple approximative algorithms for free-support Wasserstein barycenters	1
DC Semidefinite programming and cone constrained DC optimization I: theory	1
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction	1
A parallel splitting ALM-based algorithm for separable convex programming	1
OFFO minimization algorithms for second-order optimality and their complexity	1
Accelerated inexact composite gradient methods for nonconvex spectral optimization problems	1
Distributionally robust Weber problem with uncertain demand	1
A branch-and-prune algorithm for discrete Nash equilibrium problems	1
A harmonic framework for stepsize selection in gradient methods	1
Error estimates for Runge–Kutta schemes of optimal control problems with index 1 DAEs	1
Accelerated gradient sliding for structured convex optimization	1
Nonconvex robust programming via value-function optimization	1
A piecewise conservative method for unconstrained convex optimization	1
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique	1
SDP-based bounds for graph partition via extended ADMM	1
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization	1
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities	1