A potential reduction algorithm for an extended SDP problem
From MaRDI portal
Recommendations
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Infeasible potential reduction algorithms for semidefinite programming
- scientific article; zbMATH DE number 2063456
- scientific article; zbMATH DE number 1791165
- The quadratic semi-definite programming problem and its interior point algorithm
Cites work
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
Cited in
(15)- On filter-successive linearization methods for nonlinear semidefinite programming
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- Affine reductions for LPs and SDPs
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- A Unified Theorem on SDP Rank Reduction
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- Solving a class of inverse semidefinite quadratic programming problem
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
- A theoretical and numerical study of an interior-point algorithm for convex quadratic semidefinite optimization
- A numerical study of an infeasible interior-point algorithm for convex quadratic semi-definite optimization
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
This page was built for publication: A potential reduction algorithm for an extended SDP problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974204)
