Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
From MaRDI portal
Publication:3083522
Recommendations
- An affine-scaling interior-point CBB method for box-constrained optimization
- Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization
- scientific article; zbMATH DE number 5989774
- scientific article; zbMATH DE number 4197754
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- An affine scaling interior algorithm via conjugate gradient path for solving bound-constrained nonlinear systems
- scientific article; zbMATH DE number 1526956
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
Cites work
- A New Active Set Algorithm for Box Constrained Optimization
- A new trust region algorithm for bound constrained minimization
- A nonmonotone trust region method for nonlinear programming with simple bound constraints
- A trust-region strategy for minimization on arbitrary domains
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Computing a Trust Region Step
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- Convergence properties of trust region methods for linear and convex constraints
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Exposing Constraints
- Family of projected descent methods for optimization problems with simple bounds
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
Cited in
(8)- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints
- An affine-scaling interior-point CBB method for box-constrained optimization
- Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization
- Impulse noise removal by an adaptive trust-region method
- An affine scaling method for optimization problems with polyhedral constraints
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
This page was built for publication: Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083522)
