Pages that link to "Item:Q1373731"
From MaRDI portal
The following pages link to Complementarity and nondegeneracy in semidefinite programming (Q1373731):
Displaying 50 items.
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs (Q304224) (← links)
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (Q306395) (← links)
- Variational principles and the related bounding theorems for bi-modulus materials (Q339858) (← links)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- Universal rigidity of bar frameworks via the geometry of spectrahedra (Q522288) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming (Q535069) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
- On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
- The algebraic degree of semidefinite programming (Q847857) (← links)
- Universal duality in conic convex optimization (Q868444) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- A Newton-like method for solving rank constrained linear matrix inequalities (Q880379) (← links)
- First order solutions in conic programming (Q890175) (← links)
- Analyticity of weighted central paths and error bounds for semidefinite programming (Q948959) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
- On parametric semidefinite programming (Q1294552) (← links)
- A long-step primal-dual path-following method for semidefinite programming (Q1306474) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Eigenvalue-constrained faces (Q1375525) (← links)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms (Q1378999) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Optimal estimation of sensor biases for asynchronous multi-sensor data fusion (Q1650785) (← links)
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming (Q1694389) (← links)
- A note on probably certifiably correct algorithms (Q1695210) (← links)
- Statistical inference of semidefinite programming (Q1739028) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Two-phase simplex method for linear semidefinite optimization (Q2010151) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On an SDP relaxation for kissing number (Q2174884) (← links)
- Statistical inference of semidefinite programming with multiple parameters (Q2190284) (← links)
- An admissible dual internal point method for a linear semidefinite programming problem (Q2261706) (← links)
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix (Q2275573) (← links)
- Inverse optimal control for discrete-time finite-horizon linear quadratic regulators (Q2280983) (← links)
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming (Q2330654) (← links)
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach (Q2379691) (← links)
- Convex sets with semidefinite representation (Q2391000) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues (Q2433931) (← links)
