Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
From MaRDI portal
(Redirected from Publication:2116587)
Recommendations
- Primal-dual Newton's method with steepest descent for linear programming
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
- Primal-dual Newton method for linear programming problems
- Convergence of the primal-dual Newton method for linear programming problems
- Direct Newton method for a linear problem of semidefinite programming
- Primal Newton method for the linear cone programming problem
- On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming
- New complexity analysis of the primal-dual Newton method for linear optimization
- On a primal-dual Newton proximal method for convex quadratic programs
- On convergence of the dual Newton method for a linear semidefinite programming problem
Cites work
- scientific article; zbMATH DE number 1261669 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Convergence of the primal-dual Newton method for linear programming problems
- First- and second-order methods for semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- ON MATRICES DEPENDING ON PARAMETERS
- Primal-dual Newton method for linear programming problems
- Semidefinite Programming
- Semidefinite optimization
- Semidefinite programming and integer programming
- The Elimination Matrix: Some Lemmas and Applications
Cited in
(5)- Direct Newton method for a linear problem of semidefinite programming
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
- Primal-dual Newton method for linear programming problems
- Primal-dual Newton's method with steepest descent for linear programming
- Generalization of the subset sum problem and cubic forms
This page was built for publication: Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116587)