On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
type: Item
instance of: scholarly article
title: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
zbMATH Open document ID: 1134.90542
author: Andreas Wächter
author: Lorenz T. Biegler
published in: Mathematical Programming. Series A. Series B
publication date: 2006-05-02T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5021379
zbMATH Keywords: Nonlinear programming
zbMATH Keywords: Nonconvex constrained optimization
zbMATH Keywords: Filter method
zbMATH Keywords: Line search
zbMATH Keywords: Interior-point method
zbMATH Keywords: Barrier method
Wikidata QID: Q56221738
describes a project that uses: KNITRO
describes a project that uses: SifDec
describes a project that uses: HSL
describes a project that uses: LANCELOT
describes a project that uses: SNOPT
describes a project that uses: ipfilter
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s10107-004-0559-y
OpenAlex ID: W2123871098
cites work: Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
cites work: A trust region method based on interior point techniques for nonlinear programming.
cites work: An Interior Point Algorithm for Large-Scale Nonlinear Programming
cites work: Q3837875
cites work: The watchdog technique for forcing convergence in algorithms for constrained optimization
cites work: Q4023146
cites work: Trust Region Methods
cites work: A primal-dual trust-region algorithm for non-convex nonlinear programming
cites work: Benchmarking optimization software with performance profiles.
cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming
cites work: Q5588268
cites work: Q4226179
cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
cites work: Nonlinear programming without a penalty function.
cites work: On the Global Convergence of a Filter--SQP Algorithm
cites work: Interior Methods for Nonlinear Optimization
cites work: Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
cites work: CUTEr and SifDec
cites work: Numerical Optimization
cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
cites work: A globally convergent primal-dual interior-point filter method for nonlinear programming
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: Failure of global convergence for a class of interior point methods for nonlinear programming
cites work: Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
cites work: An interior algorithm for nonlinear optimization that combines line search and trust region steps
cites work: A globally convergent primal-dual interior point method for constrained optimization
cites work: A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
DOI: 10.1007/S10107-004-0559-Y
description: scientific article