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
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
Cited in
(45)- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- 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
- A decomposition method for large-scale box constrained optimization
- A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities
- On the convergence rate of Newton interior-point methods in the absence of strict complementarity
- Local analysis of a new multipliers method
- An active set feasible method for large-scale minimization problems with bound constraints
- Constrained dogleg methods for nonlinear systems with simple bounds
- A trust region affine scaling method for bound constrained optimization
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- Globally convergent DC trust-region methods
- A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors
- A two-stage active-set algorithm for bound-constrained optimization
- Exact optimal experimental designs with constraints
- A Newton-type method for constrained least-squares data-fitting with easy-to-control rational curves
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Local analysis of the feasible primal-dual interior-point method
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- A conic affine scaling dogleg method for nonlinear optimization with bound constraints
- A trust region method based on a new affine scaling technique for simple bounded optimization
- Computational experience with numerical methods for nonnegative least-squares problems.
- On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- An active set algorithm for nonlinear optimization with polyhedral constraints
- An augmented Lagrangian affine scaling method for nonlinear programming
- scientific article; zbMATH DE number 1329062 (Why is no real title available?)
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- scientific article; zbMATH DE number 1569003 (Why is no real title available?)
- An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming
- Numerical methods for nonlinear equations
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- The rate of convergence of a NLM based on F-B NCP for constrained optimization problems without strict complementarity
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An interior global method for nonlinear systems with simple bounds
- Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
- Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
- 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
- An interior-point algorithm for computing equilibria in economies with incomplete asset markets
- A reduced Newton method for constrained linear least-squares problems
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A local convergence property of primal-dual methods for nonlinear programming
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)
