Pages that link to "Item:Q3629521"
From MaRDI portal
The following pages link to An Augmented Primal-Dual Method for Linear Conic Programs (Q3629521):
Displaying 15 items.
- A trust region method for solving semidefinite programs (Q354640) (← links)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- On the regularity of second order cone programs and an application to solving large scale problems (Q999131) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
- On a box-constrained linear symmetric cone optimization problem (Q2420823) (← links)
- Projection Methods in Conic Optimization (Q2802538) (← links)
- Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- High-accuracy solution of large-scale semidefinite programs (Q5200555) (← links)
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems (Q5299903) (← links)
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming (Q5962727) (← links)
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming (Q6161315) (← links)
