Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
From MaRDI portal
Publication:4229474
DOI10.1137/S1052623497322279zbMath0957.65056MaRDI QIDQ4229474
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
barrier methodconstrained optimizationprimal-dual methoderror boundsnonlinear programminginterior point methodill-conditioning
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Interior-point solver for large-scale quadratic programming problems with bound constraints, Extreme points of well-posed polytopes, Unified theory of augmented Lagrangian methods for constrained global optimization, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, A stable primal-dual approach for linear programming under nondegeneracy assumptions, Constraint Interface Preconditioning for Topology Optimization Problems, The interior-point revolution in optimization: History, recent developments, and lasting consequences, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, Newton-KKT interior-point methods for indefinite quadratic programming, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, Stability and accuracy of inexact interior point methods for convex quadratic programming, Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods, A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming, Simultaneous solution approaches for large optimization problems., Conditioning of linear-quadratic two-stage stochastic optimization problems, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Ragnar Frisch and interior-point methods, Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming., Truncated aggregate homotopy method for nonconvex nonlinear programming, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, Local behavior of the Newton method on two equivalent systems from linear programming, Advances in trust region algorithms for constrained optimization, Metric regularity of semi-infinite constraint systems, Inertia-controlling factorizations for optimization algorithms, Primal-dual Newton-type interior-point method for topology optimization
Uses Software
