An active set feasible method for large-scale minimization problems with bound constraints
From MaRDI portal
Publication:1928749
DOI10.1007/s10589-012-9506-7zbMath1284.90075OpenAlexW2003725071MaRDI QIDQ1928749
Stefano Lucidi, Gianni Di Pillo, Marianna De Santis
Publication date: 4 January 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9506-7
active set methodsBarzilai-Borwein gradient methodsbound constrained minimization problemslarge-scale minimization problemsnonmonotone Newton-type methodsprojected Newton-type methods
Related Items
A two-stage active-set algorithm for bound-constrained optimization, An augmented Lagrangian method exploiting an active-set strategy and second-order information, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy, A novel projected gradient-like method for optimization problems with simple constraints, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Dual approaches for a specific class of integer nonlinear programming problems, Combinatorial optimal control of semilinear elliptic PDEs, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, 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, An active-set algorithmic framework for non-convex optimization problems over the simplex
Uses Software
Cites Work
- Unnamed Item
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Algorithms for bound constrained quadratic programming problems
- A new trust region algorithm for bound constrained minimization
- Family of projected descent methods for optimization problems with simple bounds
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Evaluating bound-constrained minimization software
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A New Active Set Algorithm for Box Constrained Optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- 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
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
