A Primal-Dual Exterior Point Method for Nonlinear Optimization
From MaRDI portal
Publication:3083334
Recommendations
- Primal–dual exterior point method for convex optimization
- scientific article; zbMATH DE number 6535320
- scientific article; zbMATH DE number 5630197
- Primal-dual point method for nonlinear programming
- scientific article; zbMATH DE number 1024637
- Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
- scientific article; zbMATH DE number 1186888
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- A primal-dual interior point method for nonlinear semidefinite programming
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems
Cited in
(8)- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
- Exterior distance function
- Primal–dual exterior point method for convex optimization
- An exterior point method for the convex programming problem
- scientific article; zbMATH DE number 6535320 (Why is no real title available?)
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming
- An entire space polynomial-time algorithm for linear programming
- An exterior point polynomial-time algorithm for convex quadratic programming
This page was built for publication: A Primal-Dual Exterior Point Method for Nonlinear Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083334)