Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
From MaRDI portal
Publication:2672023
DOI10.1134/S0965542522040133zbMATH Open1493.90128MaRDI QIDQ2672023FDOQ2672023
Authors: Yanyan Li
Publication date: 8 June 2022
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- Primal-dual Newton's method with steepest descent for linear programming
- Primal-dual Newton method for linear programming problems
- On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming
- Convergence of the primal-dual Newton method for linear programming problems
- scientific article; zbMATH DE number 741122
- A new primal-dual interior-point algorithm for solving semidefinite optimization
- A new primal-dual interior-point algorithm for semidefinite optimization
- A primal-dual interior point method for nonlinear semidefinite programming
- On convergence of the dual Newton method for a linear semidefinite programming problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite Programming
- Semidefinite optimization
- ON MATRICES DEPENDING ON PARAMETERS
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Complementarity and nondegeneracy in semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- The Elimination Matrix: Some Lemmas and Applications
- First- and second-order methods for semidefinite programming
- Primal-dual Newton method for linear programming problems
- Title not available (Why is that?)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- Convergence of the primal-dual Newton method for linear programming problems
Cited In (4)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- Direct Newton method for a linear problem of semidefinite programming
- Primal-dual Newton's method with steepest descent for linear programming
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization
This page was built for publication: Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672023)