A two-stage active-set algorithm for bound-constrained optimization
From MaRDI portal
Publication:2359771
DOI10.1007/s10957-016-1024-9zbMath1398.90170arXiv1607.08498OpenAlexW3105530473MaRDI QIDQ2359771
Stefano Lucidi, Andrea Cristofari, Francesco Rinaldi, Marianna De Santis
Publication date: 22 June 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.08498
large-scale optimizationactive-set methodsbound-constrained optimizationnon-monotone stabilization techniques
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Newton-type methods (49M15)
Related Items
An augmented Lagrangian method exploiting an active-set strategy and second-order information, LMBOPT: a limited memory method for bound-constrained optimization, Projection under pairwise distance control, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, An active set trust-region method for bound-constrained optimization, An improved bilevel optimization approach for image super-resolution based on a fractional diffusion tensor, Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, An improved spatially controlled reaction-diffusion equation with a non-linear second order operator for image super-resolution, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, A novel projected gradient-like method for optimization problems with simple constraints, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, 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, An active-set algorithmic framework for non-convex optimization problems over the simplex, A decomposition method for Lasso problems with zero-sum constraint
Uses Software
Cites Work
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- Family of projected descent methods for optimization problems with simple bounds
- 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
- Evaluating bound-constrained minimization software
- An active set feasible method for large-scale minimization problems with bound constraints
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A class on nonmonotone stabilization methods in unconstrained optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Second-order negative-curvature methods for box-constrained and general 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
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A differentiable exact penalty function for bound constrained quadratic programming problems
- A New Active Set Algorithm for Box Constrained Optimization
- Two-Point Step Size Gradient Methods
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Benchmarking optimization software with performance profiles.
- Unnamed Item
