Initialization in semidefinite programming via a self-dual skew-symmetric embedding
From MaRDI portal
Publication:1362529
Recommendations
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- An exact duality theory for semidefinite programming and its complexity implications
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Complementarity and nondegeneracy in semidefinite programming
- Convergence behavior of interior-point algorithms
- Interior Point Trajectories in Semidefinite Programming
- On a homogeneous algorithm for the monotone complementarity problem
- On homogeneous and self-dual algorithms for LCP
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Semidefinite Programming
- Superlinear convergence of interior-point algorithms for semidefinite programming
- Symmetric primal-dual path-following algorithms for semidefinite programming
- The theory of linear programming:skew symmetric self-dual problems and the central path*
Cited in
(34)- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Solving semidefinite programs using preconditioned conjugate gradients
- Constructing uniquely realizable graphs
- A new barrier for a class of semidefinite problems
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- A tighter relaxation for the relative pose problem between cameras
- Limiting behavior of the central path in semidefinite optimization
- Embedding methods for semidefinite programming
- Semidefinite programming
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
- Generating and measuring instances of hard semidefinite programs
- Facial reduction and partial polyhedrality
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
- On the behavior of the homogeneous self-dual model for conic convex optimization
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Error bounds and singularity degree in semidefinite programming
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Characterizing the universal rigidity of generic frameworks
- On the identification of the optimal partition for semidefinite optimization
- Conic convex programming and self-dual embedding
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Interior Point Methods for Nonlinear Optimization
- Second-order cone programming for frictional contact mechanics using interior point algorithm
- Fast certifiable relative pose estimation with gravity prior
- A rounding procedure for semidefinite optimization
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Analyticity of the central path at the boundary point in semidefinite programming
- An easy way to teach interior-point methods.
This page was built for publication: Initialization in semidefinite programming via a self-dual skew-symmetric embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362529)
