The following pages link to (Q4327459):
Displaying 34 items.
- A trust region method for solving semidefinite programs (Q354640) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- Robust constrained model predictive control using linear matrix inequalities (Q674928) (← links)
- Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming (Q1365057) (← links)
- A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming (Q1366428) (← links)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms (Q1378999) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- On a commutative class of search directions for linear programming over symmetric cones (Q1599289) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
- A potential reduction algorithm for an extended SDP problem (Q1974204) (← links)
- A proximal augmented method for semidefinite programming problems (Q2048441) (← links)
- An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
- The \(Q\) method for second order cone programming (Q2459387) (← links)
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function (Q2583508) (← links)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process (Q2672023) (← links)
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization (Q2706359) (← links)
- Quasi-min-max model predictive control for image-based visual servoing with tensor product model transformation (Q2789937) (← links)
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization (Q2802529) (← links)
- (Q3072064) (← links)
- (Q3574026) (← links)
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> (Q4235448) (← links)
- On homogeneous interrior-point algorithms for semidefinite programming (Q4391293) (← links)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
- A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming (Q4504775) (← links)
- On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions (Q4504776) (← links)
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs (Q4785859) (← links)
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision (Q4943940) (← links)
