Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
From MaRDI portal
Publication:1970367
DOI10.1007/S101070050107zbMATH Open0945.49023OpenAlexW2094960695WikidataQ58048110 ScholiaQ58048110MaRDI QIDQ1970367FDOQ1970367
Stefan Ulbrich, Michael Ulbrich, M. Heinkenschloss
Publication date: 3 October 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050107
Recommendations
- Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
nonlinear programmingdegeneracysufficient optimality conditionssuperlinear convergencebound constraintsinterior-point algorithmsaffine-scaling
Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Newton-type methods (49M15) Numerical methods based on necessary conditions (49M05)
Cited In (44)
- 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
- 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
- A local convergence property of primal-dual methods for nonlinear programming
- Title not available (Why is that?)
- Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity
- An interior global method for nonlinear systems with simple bounds
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- An accurate active set Newton algorithm for large scale bound 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
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Title not available (Why is that?)
- 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
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities
- Globally convergent DC trust-region methods
- Local analysis of the feasible primal-dual interior-point method
- 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
- Numerical methods for nonlinear equations
- The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity
- Computational experience with numerical methods for nonnegative least-squares problems.
- Local analysis of a new multipliers method
- 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
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors
- An augmented Lagrangian affine scaling method for nonlinear programming
- Exact optimal experimental designs with constraints
- An interior-point algorithm for computing equilibria in economies with incomplete asset markets
- Constrained dogleg methods for nonlinear systems with simple bounds
- On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
This page was built for publication: Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970367)
