An active-set algorithmic framework for non-convex optimization problems over the simplex
From MaRDI portal
Publication:782910
DOI10.1007/s10589-020-00195-xzbMath1447.90038arXiv1703.07761OpenAlexW3104862062MaRDI QIDQ782910
Francesco Rinaldi, Marianna De Santis, Andrea Cristofari, Stefano Lucidi
Publication date: 29 July 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.07761
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, A decomposition method for Lasso problems with zero-sum constraint, Avoiding bad steps in Frank-Wolfe variants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An active set algorithm for nonlinear optimization with polyhedral constraints
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Algorithms for bound constrained quadratic programming problems
- Evolution towards the maximum clique
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- Solution methodologies for the smallest enclosing circle problem
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- An active set feasible method for large-scale minimization problems with bound constraints
- A two-stage active-set algorithm for bound-constrained optimization
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
- Projection onto a Polyhedron that Exploits Sparsity
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- A New Active Set Algorithm for Box Constrained Optimization
- Some comments on Wolfe's ‘away step’
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Accurate Identification of Active Constraints
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Iterative Solution of Nonlinear Equations in Several Variables
- Splitting methods for the Eigenvalue Complementarity Problem
