The following pages link to QSDP (Q16894):
Displaying 49 items.
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
- Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- A regularized strong duality for nonsymmetric semidefinite least squares problem (Q644518) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (Q716749) (← links)
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming (Q1694389) (← links)
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market (Q1709750) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
- A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach (Q2379691) (← links)
- On a box-constrained linear symmetric cone optimization problem (Q2420823) (← links)
- Numerical solution of a class of quasi-linear matrix equations (Q2689160) (← links)
- Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization (Q2696952) (← links)
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem (Q3005390) (← links)
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming (Q3058503) (← links)
- (Q3067612) (← links)
- (Q3076648) (← links)
- Local Duality of Nonlinear Semidefinite Programming (Q3169023) (← links)
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem (Q3225245) (← links)
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix (Q3435003) (← links)
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming (Q3497617) (← links)
- A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure (Q3545258) (← links)
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints (Q3584167) (← links)
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659) (← links)
- Dualize it: software for automatic primal and dual conversions of conic programs (Q3632937) (← links)
- Ordinal Distance Metric Learning with MDS for Image Ranking (Q4604921) (← links)
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP (Q4899024) (← links)
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond (Q5149523) (← links)
- A preconditioned Newton algorithm for the nearest correlation matrix (Q5189126) (← links)
- A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations (Q5189572) (← links)
- Navigating in a Graph by Aid of Its Spanning Tree Metric (Q5892569) (← links)
