Questions tagged [semidefinite-programming]

Filter by
Sorted by
Tagged with
0 votes
0 answers

How to check optimality of conic optimization problem

I'm trying to solve this problem, but I'm not sure if it is possible to check the optimality of this problem. $$\min_{K,L} \quad Tr(L^\top L)\qquad\\ \text{s.t.} \quad K^\top L = A^\top Q\\ \qquad \...
Jisun Lee's user avatar
1 vote
1 answer

interior point computational complexity for SDP

I am trying to get the complexity of the SDP problem for my specific problem, but I’m facing some problems. I found in the literature that the complexity of the SDP problem for an interior point per ...
R. Sh's user avatar
  • 11
1 vote
0 answers

Distributionally Robust Stochastic Programming - Help with derivation

I've been working through this book on robust optimization of electric energy systems, and in particular chapter 4 on distributionally robust optimization. In following the derivation of section 4.2.1....
asfiwefewrno's user avatar
3 votes
2 answers

Augmented Lagrangian Function for Semidefinite Programming Problems

I am currently reading the paper "Alternating direction augmented Lagrangian methods for semidefinite programming" and was wondering about how one comes up with the Augmented Lagrangian ...
benebrue's user avatar
4 votes
0 answers

Adequate SDP solvers for large problem instances

I have previously used MOSEK for all my SDP needs. Recently, though, I am having a hard time trying to solve some large problems, due to lack of memory. In similar questions around the forum, SCS has ...
cdg's user avatar
  • 49
2 votes
1 answer

Solver for nonlinear semidefinite optimization

Totally new to optimization. Is there an easy-to-use solver, package, (free) software for solving nonlinear semidefinite optimization problems?
Morcus's user avatar
  • 129
3 votes
1 answer

Non-symmetric Positive Definite/Semidefinite Matrix in Quadratic Program

A necessary condition in any quadratic programming to be convex is the matrix $\mathbf{Q}$ in the formulation $x^\intercal \mathbf{Q}x$ to be positive definite or positive semidefinite. Positive ...
Ibrahim Amer's user avatar
2 votes
0 answers

Is this semidefinite constraint in fact pointless?

On Wikipedia, I encountered a statement that the semidefinite relaxation of a quadratically constrained quadratic program can be solved more efficiently (using only LP) in the case that no variable is ...
Lars H's user avatar
  • 201
4 votes
1 answer

Conditions required for strong duality to hold for SDPs

According to Wikipedia, strong duality holds when "the primal optimal objective and the dual optimal objective are equal." What are the necessary conditions for strong duality to hold in ...
kanso37's user avatar
  • 173