Pages that link to "Item:Q868465"

The following pages link to On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465):

Displaying 18 items.

• PENSDP (Q17259) (← links)
• A trust region method for solving semidefinite programs (Q354640) (← links)
• SOC-monotone and SOC-convex functions vs. matrix-monotone and matrix-convex functions (Q442689) (← links)
• Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers'' (Q1016358) (← links)
• New results on the application of the passification method. A survey (Q1792516) (← links)
• Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
• A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
• A proximal augmented method for semidefinite programming problems (Q2048441) (← links)
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
• Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
• Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
• Projection Methods in Conic Optimization (Q2802538) (← links)
• PENNON: Software for Linear and Nonlinear Matrix Inequalities (Q2802545) (← links)
• Primal-Dual Interior Point Multigrid Method for Topology Optimization (Q2818251) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• The Legendre Transformation in Modern Optimization (Q2957720) (← links)
• A preconditioned iterative interior point approach to the conic bundle subproblem (Q6126660) (← links)