Keywords
Interior point methodMathematicsMathematical optimizationTrust regionLine searchConvergence (economics)Sequential quadratic programmingPenalty methodScale (ratio)Dual (grammatical number)Optimization problemPoint (geometry)Quadratic programmingComputer science
Affiliated Institutions
Related Publications
A Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primal-dual interior-point algorithm for nonlinear programming, avoiding the use of m...
A globally convergent primal-dual interior point method for constrained optimization
Abstract This paper proposes a primal-dual interior point method for solving general nonlinearly constrained optimization problems. The method is based on solving the Barrier Ka...
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
An exact-penalty-function-based scheme---inspired from an old idea due to Mayne and Polak [Math. Program., 11 (1976), pp.67--80]---is proposed for extending to general smooth co...
Trust Region Methods
Preface 1. Introduction Part I. Preliminaries: 2. Basic Concepts 3. Basic Analysis and Optimality Conditions 4. Basic Linear Algebra 5. Krylov Subspace Methods Part II. Trust-Re...
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
We present an O(√nL)-iteration homogeneous and self-dual linear programming (LP) algorithm. The algorithm possesses the following features: • It solves the linear programming pr...
Publication Info
- Year
- 2004
- Type
- article
- Volume
- 102
- Issue
- 1
- Pages
- 111-151
- Citations
- 53
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
53
OpenAlex
Cite This
Hiroshi Yamashita,
Hiroshi Yabe,
Takahito Tanabe
(2004).
A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization.
Mathematical Programming
, 102
(1)
, 111-151.
https://doi.org/10.1007/s10107-004-0508-9
Identifiers
- DOI
- 10.1007/s10107-004-0508-9