A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
From MaRDI portal
Recommendations
- Globally convergent interior-point algorithm for nonlinear programming
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A trust region method based on interior point techniques for nonlinear programming.
- scientific article; zbMATH DE number 5630197
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
Cited in
(22)- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- A penalty-interior-point algorithm for nonlinear constrained optimization
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- An arc-search interior-point algorithm for nonlinear constrained optimization
- A globally convergent regularized interior point method for constrained optimization
- A penalized interior point approach for constrained nonlinear programming
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- Globally convergent interior-point algorithm for nonlinear programming
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A modified SQP-filter method for nonlinear complementarity problem
- Improving ultimate convergence of an augmented Lagrangian method
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- scientific article; zbMATH DE number 6535320 (Why is no real title available?)
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
- On second-order optimality conditions for nonlinear programming
- A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
This page was built for publication: A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651988)
