Globally convergent interior-point algorithm for nonlinear programming
From MaRDI portal
Publication:2569192
Recommendations
- scientific article; zbMATH DE number 764395
- A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- A globally convergent primal-dual interior point method for constrained optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
Cites work
- A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
- An interior point algorithm for computing saddle points of constrained continuous minimax
- An interior-point algorithm for nonconvex nonlinear programming
- Convergent stepsizes for constrained optimization algorithms
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Globally convergent interior-point algorithm for nonlinear programming
- scientific article; zbMATH DE number 1186888 (Why is no real title available?)
- IP from an SQP point of view
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- The watchdog technique for forcing convergence in algorithms for constrained optimization
Cited in
(20)- A globally convergent interior point algorithm for non-convex nonlinear programming
- A globally convergent algorithm for nonlinearly constrained optimization problems
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- Convergence of an interior point algorithm for continuous minimax
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Globally convergent interior-point algorithm for nonlinear programming
- Mixed integer nonlinear programming using interior-point methods
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- scientific article; zbMATH DE number 764395 (Why is no real title available?)
- The resolution of the optimal reactive dispatch problem via the relaxed barrier-Lagrangian function method
- A globally convergent regularized interior point method for constrained optimization
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- Duality in convex optimization for the hyperbolic augmented Lagrangian
- Numerical experiments with an interior-exterior point method for nonlinear programming
- An interior-point algorithm for nonlinear minimax problems
This page was built for publication: Globally convergent interior-point algorithm for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569192)
