On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
From MaRDI portal
Publication:853889
DOI10.1007/s10589-006-6514-5zbMath1151.90552OpenAlexW2089333839MaRDI QIDQ853889
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
Newton's methodinterior-point methodquadratic convergenceaffine scalingidentification of active constraints
Related Items (37)
A trust region method with project step for bound constrained optimization without compact condition ⋮ 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 ⋮ A two-stage active-set algorithm for bound-constrained optimization ⋮ A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints ⋮ Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity ⋮ A Newton-type method for constrained least-squares data-fitting with easy-to-control rational curves ⋮ A reduced Newton method for constrained linear least-squares problems ⋮ An augmented Lagrangian affine scaling method for nonlinear programming ⋮ Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization ⋮ A decomposition method for large-scale box constrained optimization ⋮ An interior-point affine-scaling trust-region method for semismooth equations with box constraints ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities ⋮ An active set trust-region method for bound-constrained optimization ⋮ A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints ⋮ On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems ⋮ An active set feasible method for large-scale minimization problems with bound constraints ⋮ Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints ⋮ Constrained dogleg methods for nonlinear systems with simple bounds ⋮ A novel projected gradient-like method for optimization problems with simple constraints ⋮ A trust region affine scaling method for bound constrained optimization ⋮ A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization ⋮ An accurate active set conjugate gradient algorithm with project search for bound constrained optimization ⋮ A feasible direction method for the semidefinite program with box constraints ⋮ 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 scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors ⋮ Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems ⋮ Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization ⋮ Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities ⋮ An affine-scaling interior-point CBB method for box-constrained optimization ⋮ 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 CONIC AFFINE SCALING DOGLEG METHOD FOR NONLINEAR OPTIMIZATION WITH BOUND CONSTRAINTS ⋮ Numerical solution of KKT systems in PDE-constrained optimization problems via the affine scaling trust-region approach† ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new trust region algorithm for bound constrained minimization
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Solution of monotone complementarity problems with locally Lipschitzian functions
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- STRSCNE: a scaled trust-region solver for constrained nonlinear equations
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A nonsmooth version of Newton's method
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- Optimization and nonsmooth analysis
- 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
- Strongly Regular Generalized Equations
- Algorithm 778: L-BFGS-B
- On the Accurate Identification of Active Constraints
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Pattern Search Algorithms for Bound Constrained Minimization
- 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
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- An interior global method for nonlinear systems with simple bounds
- Strictly feasible equation-based methods for mixed complementarity problems
This page was built for publication: On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints