Pages that link to "Item:Q4504774"
From MaRDI portal
The following pages link to A study of search directions in primal-dual interior-point methods for semidefinite programming (Q4504774):
Displaying 43 items.
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
- Semidefinite programming for the educational testing problem (Q953303) (← links)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Interior-point methods (Q1593831) (← links)
- Semidefinite programming (Q1600854) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture (Q1989097) (← links)
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
- A primal-dual interior point method for large-scale free material optimization (Q2350868) (← links)
- Credible autocoding of convex optimization algorithms (Q2358081) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- A new smooth NCP function for solving semidefinite nonlinear complementarity problems (Q2682769) (← links)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- The spectral bundle method with second-order information (Q2926057) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
- On the connections between semidefinite optimization and vector optimization (Q4469110) (← links)
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming (Q4609469) (← links)
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) (← links)
- Efficient solution of second order cone program for model predictive control (Q4814128) (← links)
- A robust algorithm for semidefinite programming (Q5200556) (← links)
- A primal–dual regularized interior-point method for semidefinite programming (Q5268898) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)
- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones (Q6161308) (← links)
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407) (← links)