Interior point methods for large-scale nonlinear programming
From MaRDI portal
Recommendations
- Interior‐point method for non‐linear non‐convex optimization
- Practical implementation of an interior point nonmonotone line search filter method
- An interior-point algorithm for nonconvex nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- scientific article; zbMATH DE number 2143182
Cites work
- scientific article; zbMATH DE number 1406968 (Why is no real title available?)
- An interior-point algorithm for nonconvex nonlinear programming
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- CUTE
- Constraint Preconditioning for Indefinite Linear Systems
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Interior Methods for Nonlinear Optimization
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Interior‐point method for non‐linear non‐convex optimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Nonlinear programming without a penalty function.
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the occasion of the 60th birthday of Raytcho Lazarov
- Preconditioning indefinite systems in interior point methods for optimization
- Truncated-Newton algorithms for large-scale unconstrained optimization
Cited in
(12)- An interior-point method for large constrained discrete ill-posed problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Inner solvers for interior point methods for large scale nonlinear programming
- scientific article; zbMATH DE number 2143182 (Why is no real title available?)
- scientific article; zbMATH DE number 1452530 (Why is no real title available?)
- A starting point strategy for nonlinear interior methods.
- scientific article; zbMATH DE number 5233132 (Why is no real title available?)
- Interior‐point method for non‐linear non‐convex optimization
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
This page was built for publication: Interior point methods for large-scale nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717543)
