Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

(2014) V. Jeyakumar et al.   JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

A new class of alternative theorems for SOS-convex inequalities and robust optimization

(2013) V. Jeyakumar et al.   APPLICABLE ANALYSIS

Optimality conditions and finite convergence of Lasserre’s hierarchy

(2013) Jiawang Nie   MATHEMATICAL PROGRAMMING

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

(2013) V. Jeyakumar et al.   OPERATIONS RESEARCH LETTERS

Algorithm 920

(2012) Sunyoung Kim et al.   ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

(2012) V. Jeyakumar et al.   OPERATIONS RESEARCH LETTERS

Partitioning procedure for polynomial optimization

(2010) Polyxeni-Margarita Kleniati et al.   JOURNAL OF GLOBAL OPTIMIZATION

Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion

(2010) Sunyoung Kim et al.   MATHEMATICAL PROGRAMMING

Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets

(2010) Hà Huy Vui et al.   SIAM JOURNAL ON OPTIMIZATION

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

(2009) Alfred M. Bruckstein et al.   SIAM REVIEW

Algorithm 883

(2008) Hayato Waki et al.   ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

Enhancing Sparsity by Reweighted ℓ 1 Minimization

(2008) Emmanuel J. Candès et al.   JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS