On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
From MaRDI portal
Publication:853889
DOI10.1007/S10589-006-6514-5zbMATH Open1151.90552OpenAlexW2089333839MaRDI QIDQ853889FDOQ853889
Authors: Christian Kanzow, Andreas Klug 
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-6514-5
Recommendations
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints.
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity
- scientific article
Newton's methodquadratic convergenceaffine scalinginterior-point methodidentification of active constraints
Cites Work
- STRSCNE: a scaled trust-region solver for constrained nonlinear equations
- Algorithm 778: L-BFGS-B
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the Accurate Identification of Active Constraints
- Pattern Search Algorithms for Bound Constrained Minimization
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Title not available (Why is that?)
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- Strictly feasible equation-based methods for mixed complementarity problems
- A new trust region algorithm for bound constrained minimization
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- 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
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- Title not available (Why is that?)
- An interior global method for nonlinear systems with simple bounds
Cited In (45)
- An affine scaling interior point backtracking algorithm for nonlinear constrained optimisation
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Title not available (Why is that?)
- Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
- A two-stage active-set algorithm for bound-constrained optimization
- A decomposition method for large-scale box constrained optimization
- Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity
- An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization
- A conic affine scaling dogleg method for nonlinear optimization with bound constraints
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- Numerical solution of KKT systems in PDE-constrained optimization problems via the affine scaling trust-region approach
- An affine-scaling interior-point CBB method for box-constrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- A reduced Newton method for constrained linear least-squares problems
- A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- A Newton-type method for constrained least-squares data-fitting with easy-to-control rational curves
- A trust region affine scaling method for bound constrained optimization
- A trust region method with project step for bound constrained optimization without compact condition
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables
- An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming
- A trust region method based on a new affine scaling technique for simple bounded optimization
- A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors
- A feasible direction method for the semidefinite program with box constraints
- An augmented Lagrangian affine scaling method for nonlinear programming
- A novel projected gradient-like method for optimization problems with simple constraints
- A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming
- An active set trust-region method for bound-constrained optimization
- Constrained dogleg methods for nonlinear systems with simple bounds
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems
Uses Software
This page was built for publication: On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853889)
