Computational Optimization and Applications

Article	Citations
An inexact accelerated stochastic ADMM for separable convex optimization	34
QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization	22
A Riemannian rank-adaptive method for low-rank matrix completion	20
An interior point-proximal method of multipliers for convex quadratic programming	19
Randomized Kaczmarz methods for tensor complementarity problems	19
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization	18
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation	18
Sequential optimality conditions for cardinality-constrained optimization problems with applications	16
Globalized inexact proximal Newton-type methods for nonconvex composite functions	16
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates	16
On mixed-integer optimal control with constrained total variation of the integer control	16
Exploiting term sparsity in noncommutative polynomial optimization	15
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces	15
A bundle method for nonsmooth DC programming with application to chance-constrained problems	15
Conditional gradient method for multiobjective optimization	15
Single-forward-step projective splitting: exploiting cocoercivity	14
Globally convergent Newton-type methods for multiobjective optimization	14
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization	13
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization	12
On the acceleration of the Barzilai–Borwein method	12
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization	11
A product space reformulation with reduced dimension for splitting algorithms	11
The circumcentered-reflection method achieves better rates than alternating projections	11
A two-level distributed algorithm for nonconvex constrained optimization	11
Quantitative results on a Halpern-type proximal point algorithm	10

Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem	10
A stochastic subspace approach to gradient-free optimization in high dimensions	10
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems	10
An accelerated proximal gradient method for multiobjective optimization	9
On a primal-dual Newton proximal method for convex quadratic programs	9
Solving constrained nonsmooth group sparse optimization via group Capped-$$\ell _1$$ relaxation and group smoothing proximal gradient algorithm	9
A limited memory Quasi-Newton approach for multi-objective optimization	9
Parametric shape optimization using the support function	9
Gauss–Newton-type methods for bilevel optimization	8
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM	8
Strengthened splitting methods for computing resolvents	8
Forward-reflected-backward method with variance reduction	8
Constrained and unconstrained deep image prior optimization models with automatic regularization	8
Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$-controllers	7
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method	7
Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms	7
Spectral conjugate gradient methods for vector optimization problems	7
A proximal gradient method for control problems with non-smooth and non-convex control cost	7
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations	7
Fastest rates for stochastic mirror descent methods	7
Conditional gradient method for vector optimization	7
A general variable neighborhood search for the cyclic antibandwidth problem	7
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions	7
The Tikhonov regularization for vector equilibrium problems	7
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem	7
Distributed forward-backward methods for ring networks	7
Hybrid limited memory gradient projection methods for box-constrained optimization problems	7
An effective procedure for feature subset selection in logistic regression based on information criteria	7
Derivative-free methods for mixed-integer nonsmooth constrained optimization	7
Clustering-based multipopulation approaches in MOEA/D for many-objective problems	7
Efficient differentiable quadratic programming layers: an ADMM approach	6
MINLP formulations for continuous piecewise linear function fitting	6
Secant Update generalized version of PSB: a new approach	6
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming	6
Expected complexity analysis of stochastic direct-search	6
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems	6
Optimal portfolio selections via $$\ell _{1, 2}$$-norm regularization	6
On the inexact scaled gradient projection method	6
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems	6
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints	6
T-product factorization method for internet traffic data completion with spatio-temporal regularization	6
Inertial alternating direction method of multipliers for non-convex non-smooth optimization	6
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization	6
An adaptive trust-region method without function evaluations	6
A smoothing proximal gradient algorithm for matrix rank minimization problem	6
An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem	6
Bregman primal–dual first-order method and application to sparse semidefinite programming	6
Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation	5
Quadratic regularization methods with finite-difference gradient approximations	5
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials	5

Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games	5
A Laplacian approach to $$\ell _1$$-norm minimization	5
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients	5
Newton-type methods near critical solutions of piecewise smooth nonlinear equations	5
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares	5
Leveraging special-purpose hardware for local search heuristics	5
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems	5
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems	5
A zeroth order method for stochastic weakly convex optimization	5
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	5
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization	5
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation	4
Finite-sum smooth optimization with SARAH	4
DC Semidefinite programming and cone constrained DC optimization I: theory	4
Abstract strongly convergent variants of the proximal point algorithm	4
A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations	4
An augmented subgradient method for minimizing nonsmooth DC functions	4
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function	4
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems	4
Modeling design and control problems involving neural network surrogates	4
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems	4
Diagonal BFGS updates and applications to the limited memory BFGS method	4
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces	4
Cartoon-texture evolution for two-region image segmentation	4
Polyhedral approximations of the semidefinite cone and their application	4
An inexact Riemannian proximal gradient method	4
Avoiding bad steps in Frank-Wolfe variants	4
A random time-dependent noncooperative equilibrium problem	4
A trust-region approach for computing Pareto fronts in multiobjective optimization	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
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions	4
Low-rank factorization for rank minimization with nonconvex regularizers	4
Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations	4
Finding multi-objective supported efficient spanning trees	3
A proximal DC approach for quadratic assignment problem	3
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse	3
Block coordinate descent for smooth nonconvex constrained minimization	3
Generalizations of the proximal method of multipliers in convex optimization	3
Subspace quadratic regularization method for group sparse multinomial logistic regression	3
Finding the global optimum of a class of quartic minimization problem	3
A dual simplex-type algorithm for the smallest enclosing ball of balls	3
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches	3
A level set method for Laplacian eigenvalue optimization subject to geometric constraints	3
A data-driven approach for a class of stochastic dynamic optimization problems	3
A stochastic primal-dual method for a class of nonconvex constrained optimization	3
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications	3
A path-following inexact Newton method for PDE-constrained optimal control in BV	3
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems	3
$${\text {B}}$$-subdifferentials of the projection onto the matrix simplex	3
An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function	3
Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition	3
A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints	3
A harmonic framework for stepsize selection in gradient methods	3
Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm	3
Optimization over the Pareto front of nonconvex multi-objective optimal control problems	3
The continuous stochastic gradient method: part II–application and numerics	3
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm	3
A communication-efficient and privacy-aware distributed algorithm for sparse PCA	3
Quantifying uncertainty with ensembles of surrogates for blackbox optimization	3
The continuous stochastic gradient method: part I–convergence theory	3
SDP-based bounds for graph partition via extended ADMM	3
Branch-and-Model: a derivative-free global optimization algorithm	3
On the solution stability of parabolic optimal control problems	3
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction	3
An abstract convergence framework with application to inertial inexact forward–backward methods	3
A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties	3
An extrapolated iteratively reweighted $$\ell _1$$ method with complexity analysis	2
Finding best approximation pairs for two intersections of closed convex sets	2
An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems	2
Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem	2
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions	2
An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems	2
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers	2
Inexact penalty decomposition methods for optimization problems with geometric constraints	2
Inexact proximal DC Newton-type method for nonconvex composite functions	2
An alternate approach to solve two-level priority based assignment problem	2
On the properties of the cosine measure and the uniform angle subspace	2
Generating set search using simplex gradients for bound-constrained black-box optimization	2
T-product factorization based method for matrix and tensor completion problems	2

New Bregman proximal type algorithms for solving DC optimization problems	2
DC semidefinite programming and cone constrained DC optimization II: local search methods	2
Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization	2
A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles	2
Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC	2
Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization	2
Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints	2
Minimization over the $$\ell _1$$-ball using an active-set non-monotone projected gradient	2
Robust min-max regret covering problems	2
Two new bidirectional search algorithms	2
A space–time variational method for optimal control problems: well-posedness, stability and numerical solution	2
From inexact optimization to learning via gradient concentration	2
Simple approximative algorithms for free-support Wasserstein barycenters	2
Alternating conditional gradient method for convex feasibility problems	2
General-purpose preconditioning for regularized interior point methods	2
Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization	2
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization	2
Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization	2
Matrix optimization based Euclidean embedding with outliers	2
Design of a heuristic algorithm for the generalized multi-objective set covering problem	2
On R-linear convergence analysis for a class of gradient methods	2
On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction	2
A Bregman–Kaczmarz method for nonlinear systems of equations	2
A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE	2
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization	2
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint	2
Conic formulation of QPCCs applied to truly sparse QPs	2
Implementing and modifying Broyden class updates for large scale optimization	2
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space	2
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems	2
An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems	2
Radius theorems for subregularity in infinite dimensions	2
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines	2
$$\rho$$-regularization subproblems: strong duality and an eigensolver-based algorithm	1
Two methods for the maximization of homogeneous polynomials over the simplex	1
A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint	1
A generalized shortest path tour problem with time windows	1
Linear singularly perturbed systems without slow-fast split	1
Practical gradient and conjugate gradient methods on flag manifolds	1
A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems	1
Inexact gradient projection method with relative error tolerance	1
On global convergence of alternating least squares for tensor approximation	1
Efficient scalarization in multiobjective optimal control of a nonsmooth PDE	1
SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization	1
A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure	1
Robust and continuous metric subregularity for linear inequality systems	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
Accelerated inexact composite gradient methods for nonconvex spectral optimization problems	1
Using partial spectral information for block diagonal preconditioning of saddle-point systems	1
Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension	1
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations	1
A piecewise conservative method for unconstrained convex optimization	1
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences	1
Projection free methods on product domains	1
A note on the convergence of deterministic gradient sampling in nonsmooth optimization	1
Accelerated gradient sliding for structured convex optimization	1
A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity	1
A split Levenberg-Marquardt method for large-scale sparse problems	1
Nonconvex robust programming via value-function optimization	1
A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ regularization problem	1
A new proximal heavy ball inexact line-search algorithm	1
Multiobjective BFGS method for optimization on Riemannian manifolds	1
Riemannian optimization on unit sphere with p-norm and its applications	1
Distributed stochastic compositional optimization problems over directed networks	1
The deepest event cuts in risk-averse optimization with application to radiation therapy design	1
First order inertial optimization algorithms with threshold effects associated with dry friction	1
Minimum cost b-matching problems with neighborhoods	1
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique	1
OFFO minimization algorithms for second-order optimality and their complexity	1
A sublevel moment-SOS hierarchy for polynomial optimization	1
Extension of switch point algorithm to boundary-value problems	1
An easily computable upper bound on the Hoffman constant for homogeneous inequality systems	1
Eigenvalue programming beyond matrices	1
A branch-and-prune algorithm for discrete Nash equilibrium problems	1
Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes	1
Linearly convergent bilevel optimization with single-step inner methods	1
Distribution-free algorithms for predictive stochastic programming in the presence of streaming data	1
Error estimates for Runge–Kutta schemes of optimal control problems with index 1 DAEs	1
An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization	1
Optimal control problems with $$L^0(\Omega )$$ constraints: maximum principle and proximal gradient method	1
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities	1
Second order semi-smooth Proximal Newton methods in Hilbert spaces	1
A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem	1
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming	1
On solving a class of fractional semi-infinite polynomial programming problems	1
A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions	1
A study of progressive hedging for stochastic integer programming	1
Average curvature FISTA for nonconvex smooth composite optimization problems	1
A parallel splitting ALM-based algorithm for separable convex programming	1
Tensor Z-eigenvalue complementarity problems	1
Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming	1
Optimality conditions for Tucker low-rank tensor optimization	1
Compact representations of structured BFGS matrices	1
Loss functions for finite sets	1