Tag: convex-optimization


Found 21 results for 'convex-optimization'.


1) ds.algorithms - Maximizing a convex function with linear constraints
2) optimization - Solving semidefinite programs in polynomial time
3) optimization - Minimizing a convex piece-wise linear function of short $(\max, +)$ circuit length
4) linear-programming - What can be solved with semidefinite programming that can't be solved with linear programming?
5) np-hardness - Parametrized complexity of sparse optimization
6) convex-optimization - Is the feasible region of this SDP polyhedral?
7) cc.complexity-theory - On complexity of linear programming with quadratic equality/inequality constraints?
8) np-hardness - When can a convex function induce submodularity?
9) approximation-algorithms - Gradient descent-like optimization on a convex landscape with noisy sampling
10) ds.algorithms - Boyd & Vandenberghe, question 2.31(d). Stuck on simple problem regarding interior of a dual cone
11) convex-optimization - Greedy vs LP Approximation
12) linear-programming - Linear programming, a non standard handling of absolute value
13) it.information-theory - A Question on Convex Conjugate Duality for KL Divergence
14) optimization - Objective function for stochastic optimization
15) linear-algebra - Minimizing the maximum dot product among k unit vectors in an n-dimensional space
16) convex-optimization - Is the Chi-square divergence a Bregman divergence?
17) approximation-hardness - When is the duality gap of semidefinite programming (SDP) zero?
18) optimization - direct connection between gradient descent and follow the (perturbed) leader algorithm or weighted majority?
19) ds.algorithms - Generating a point in a rational polytope $P \subseteq R^k$ given a point in $P^\epsilon$
20) reference-request - Properties of convex polytope of 0-1 matrices
21) convex-optimization - Restriction of a convex function to {0, 1}^n