A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
From MaRDI portal
Publication:4651988
DOI10.1137/S1052623402400641zbMath1079.90160MaRDI QIDQ4651988
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods, A globally convergent regularized interior point method for constrained optimization, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Improving ultimate convergence of an augmented Lagrangian method, Penalized interior point approach for constrained nonlinear programming, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, A modified SQP-filter method for nonlinear complementarity problem, On second-order optimality conditions for nonlinear programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
