Interior point methods for large-scale nonlinear programming
From MaRDI portal
Publication:5717543
DOI10.1080/10556780500140508zbMath1134.90052OpenAlexW2092397038MaRDI QIDQ5717543
Ctirad Matonoha, Ladislav Lukšan, Jan Vlček
Publication date: 10 January 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://www.nusl.cz/ntk/nusl-19532
algorithmsnonlinear programminginterior point methodsfilter methodsKKT systemsindefinite preconditioners
Related Items (2)
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist ⋮ An interior-point algorithm for the minimization arising from 3D contact problems with friction
Cites Work
- Unnamed Item
- An interior-point algorithm for nonconvex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Preconditioning indefinite systems in interior point methods for optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Interior‐point method for non‐linear non‐convex optimization
- Newton-type methods for unconstrained and linearly constrained optimization
- CUTE
- Constraint Preconditioning for Indefinite Linear Systems
- Interior Methods for Nonlinear Optimization
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- On the occasion of the 60th birthday of Raytcho Lazarov
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Nonlinear programming without a penalty function.
This page was built for publication: Interior point methods for large-scale nonlinear programming
