A Primal-Dual Exterior Point Method for Nonlinear Optimization
From MaRDI portal
Publication:3083334
DOI10.1137/060676970zbMATH Open1208.49041OpenAlexW2055333640MaRDI QIDQ3083334FDOQ3083334
Hiroshi Yamashita, Takahito Tanabe
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/870424e5f56744e0518d0ed2694c719604b3ca2e
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (7)
- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
- Primal–dual exterior point method for convex optimization
- An exterior point method for the convex programming problem
- Title not available (Why is that?)
- 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
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization 👍 👎
- A primal-dual interior point method for nonlinear semidefinite programming 👍 👎
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems 👍 👎
- Primal–dual exterior point method for convex optimization 👍 👎
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization 👍 👎
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)
