A central path interior point method for nonlinear programming and its local convergence

DOI10.1080/00207160.2017.1400663zbMATH Open1499.90227OpenAlexW2767588770MaRDI QIDQ5028593FDOQ5028593

Authors: Songqiang Qiu, Zhongwen Chen 

Publication date: 10 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2017.1400663

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

zbMATH Keywords

nonlinear programminglocal convergencecentral pathprimal-dual interior-point methodtrust-funnel-like method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Cites Work

• A globally convergent primal-dual interior-point filter method for nonlinear programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Benchmarking optimization software with performance profiles.
• Title not available (Why is that?)
• A penalty-function-free line search SQP method for nonlinear programming
• Test example for nonlinear programming codes
• Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• Dynamic Control of Infeasibility in Equality Constrained Optimization
• A new penalty-free-type algorithm based on trust region techniques
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Nonlinear programming without a penalty function.
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming
• Nonlinear programming without a penalty function or a filter
• On the superlinear local convergence of a filter-SQP method
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• An interior-point algorithm for nonconvex nonlinear programming
• Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
• Flexible penalty functions for nonlinear constrained optimization
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Some non-interior path-following methods based on a scaled central path for linear complementarity problems

Uses Software

• HSL
• ipfilter
• Ipopt

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)