An accurate active set Newton algorithm for large scale bound constrained optimization.
From MaRDI portal
Publication:548593
DOI10.1007/s10492-011-0018-zzbMath1224.90177OpenAlexW1978125723MaRDI QIDQ548593
Changyin Zhou, Li Sun, Guo-Ping He, Yong-Li Wang
Publication date: 29 June 2011
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/116526
Related Items
A limited memory quasi-Newton trust-region method for box constrained optimization ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ An active set strategy based on the multiplier function or the gradient. ⋮ A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization ⋮ Hybrid variational model based on alternating direction method for image restoration ⋮ Image restoration by a mixed high-order total variation and \(l_1\) regularization model ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ On Smoothingl1Exact Penalty Function for Constrained Optimization Problems ⋮ A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse ⋮ Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing ⋮ Image restoration by second-order total generalized variation and wavelet frame regularization ⋮ A new smoothing method for solving nonlinear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- An active set strategy based on the multiplier function or the gradient.
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
- More test examples for nonlinear programming codes
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- A New Active Set Algorithm for Box Constrained Optimization
- Active Set Identification in Nonlinear Programming
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Generating box-constrained optimization problems
- Testing Unconstrained Optimization Software
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Accurate Identification of Active Constraints
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- The conjugate gradient method in extremal problems
- Convergence of a generalized SMO algorithm for SVM classifier design
This page was built for publication: An accurate active set Newton algorithm for large scale bound constrained optimization.
