A central path interior point method for nonlinear programming and its local convergence
From MaRDI portal
Publication:5028593
Recommendations
- scientific article; zbMATH DE number 1183039
- scientific article; zbMATH DE number 5630197
- An interior-point piecewise linear penalty method for nonlinear programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- From global to local convergence of interior methods for nonlinear optimization
Cites work
- scientific article; zbMATH DE number 1183039 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A new penalty-free-type algorithm based on trust region techniques
- A penalty-function-free line search SQP method for nonlinear programming
- An interior-point algorithm for nonconvex nonlinear programming
- Benchmarking optimization software with performance profiles.
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- Flexible penalty functions for nonlinear constrained optimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- Nonlinear programming without a penalty function or a filter
- Nonlinear programming without a penalty function.
- On the Global Convergence of a Filter--SQP Algorithm
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- Test example for nonlinear programming codes
Cited in
(2)
This page was built for publication: A central path interior point method for nonlinear programming and its local convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028593)