The following pages link to Pablo A. Parrilo (Q304254):
Displayed 50 items.
- Latent variable graphical model selection via convex optimization (Q132216) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Item:Q304254 (redirect page) (← links)
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts (Q344935) (← links)
- Item:Q304254 (redirect page) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Correlated equilibria in continuous games: characterization and computation (Q632966) (← links)
- Structure of extreme correlated equilibria: A zero-sum example and its implications (Q647346) (← links)
- An inequality for circle packings proved by semidefinite programming (Q701787) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones (Q747766) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- Separable and low-rank continuous games (Q999116) (← links)
- Item:Q304254 (redirect page) (← links)
- Mixed time/frequency-domain based robust identification (Q1298313) (← links)
- Semidefinite programming relaxations for semialgebraic problems (Q1424271) (← links)
- A convex approach to robust \({\mathcal H}_{2}\) performance analysis (Q1614326) (← links)
- Semidefinite approximations of the matrix logarithm (Q1740571) (← links)
- Item:Q304254 (redirect page) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- Rejoinder: Latent variable graphical model selection via convex optimization (Q1940764) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Maximizing products of linear forms, and the permanent of positive semidefinite matrices (Q2133425) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- Sums of squares in Macaulay2 (Q2184805) (← links)
- Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← links)
- Why random reshuffling beats stochastic gradient descent (Q2227529) (← links)
- A globally convergent incremental Newton method (Q2349125) (← links)
- Approximate cone factorizations and lifts of polytopes (Q2349138) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Dynamics in near-potential games (Q2437806) (← links)
- Structured semidefinite programs for the control of symmetric systems (Q2440744) (← links)
- Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming (Q2440818) (← links)
- On the asymptotic minimum number of monochromatic 3-term arithmetic progressions (Q2469204) (← links)
- Approximation of the joint spectral radius using sum of squares (Q2483273) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones (Q2687062) (← links)
- On cone-invariant linear matrix inequalities (Q2730210) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- A Complete Characterization of the Gap between Convexity and SOS-Convexity (Q2848175) (← links)
- Flows and Decompositions of Games: Harmonic and Potential Games (Q2884285) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Convex Graph Invariants (Q2913268) (← links)