相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A new class of alternative theorems for SOS-convex inequalities and robust optimization
V. Jeyakumar et al.
APPLICABLE ANALYSIS (2015)
On Polynomial Optimization Over Non-compact Semi-algebraic Sets
V. Jeyakumar et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2014)
Optimality conditions and finite convergence of Lasserre's hierarchy
Jiawang Nie
MATHEMATICAL PROGRAMMING (2014)
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
V. Jeyakumar et al.
OPERATIONS RESEARCH LETTERS (2014)
Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems
Sunyoung Kim et al.
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE (2012)
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
V. Jeyakumar et al.
OPERATIONS RESEARCH LETTERS (2012)
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Sunyoung Kim et al.
MATHEMATICAL PROGRAMMING (2011)
Partitioning procedure for polynomial optimization
Polyxeni-Margarita Kleniati et al.
JOURNAL OF GLOBAL OPTIMIZATION (2010)
REPRESENTATIONS OF POSITIVE POLYNOMIALS AND OPTIMIZATION ON NONCOMPACT SEMIALGEBRAIC SETS
Ha Huy Vui et al.
SIAM JOURNAL ON OPTIMIZATION (2010)
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Alfred M. Bruckstein et al.
SIAM REVIEW (2009)
Sum of squares method for sensor network localization
Jiawang Nie
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2009)
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
Masakazu Kojima et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2009)
SparsePOP - A sparse semidefinite programming relaxation of polynomial optimization problems
Hayato Waki et al.
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE (2008)
Enhancing Sparsity by Reweighted l1 Minimization
Emmanuel J. Candes et al.
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS (2008)
Approximation bounds for quadratic optimization with homogeneous quadratic constraints
Zhi-Quan Luo et al.
SIAM JOURNAL ON OPTIMIZATION (2007)
Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity
Hayato Waki et al.
SIAM JOURNAL ON OPTIMIZATION (2006)
Global optimization of polynomials using gradient tentacles and sums of squares
Markus Schweighofer
SIAM JOURNAL ON OPTIMIZATION (2006)
Convergent SDP-relaxations in polynomial optimization with sparsity
Jean B. Lasserre
SIAM JOURNAL ON OPTIMIZATION (2006)
Decoding by linear programming
EJ Candes et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
Sums of squares on real algebraic curves
C Scheiderer
MATHEMATISCHE ZEITSCHRIFT (2003)
Exploiting sparsity in semidefinite programming via matrix completion I: General framework
M Fukuda et al.
SIAM JOURNAL ON OPTIMIZATION (2001)
Global optimization with polynomials and the problem of moments
JB Lasserre
SIAM JOURNAL ON OPTIMIZATION (2001)
分享论文
