A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
From MaRDI portal
Publication:4521377
Recommendations
- scientific article; zbMATH DE number 5630197
- Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems
- A primal-dual interior point method for nonlinear semidefinite programming
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- scientific article; zbMATH DE number 1186888
- scientific article; zbMATH DE number 4164543
- A primal-dual interior point method with parameter perturbation for solving a class of general nonlinear programming problems
- Inexact primal-dual interior point iteration for linear programs in function spaces
Cited in
(5)- Globally convergent interior-point algorithm for nonlinear programming
- A primal-dual interior point method with parameter perturbation for solving a class of general nonlinear programming problems
- scientific article; zbMATH DE number 6535320 (Why is no real title available?)
- An interior-point algorithm for computing equilibria in economies with incomplete asset markets
- An interior-point algorithm for nonlinear minimax problems
This page was built for publication: A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521377)