On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
出版年份 2017 全文链接
标题
On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
作者
关键词
DC programming, Set containment, SOS-convex polynomials, SOS-concave matrix, Sums of squares polynomials, Strong duality, 90C30, 90C22, 26A51
出版物
MATHEMATICAL PROGRAMMING
Volume 169, Issue 1, Pages 177-198
出版商
Springer Nature
发表日期
2017-11-20
DOI
10.1007/s10107-017-1210-z
参考文献
相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- (2015) V. Jeyakumar et al. JOURNAL OF GLOBAL OPTIMIZATION
- Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- (2015) V. Jeyakumar et al. JOURNAL OF GLOBAL OPTIMIZATION
- Lagrange-type duality in DC programming
- (2014) Ryohei Harada et al. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- (2014) V. Jeyakumar et al. Optimization Letters
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- (2013) V. Jeyakumar et al. APPLICABLE ANALYSIS
- Lagrange duality in canonical DC programming
- (2013) Yukari Fujiwara et al. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
- Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs
- (2013) V. Jeyakumar et al. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- (2013) V. Jeyakumar et al. MATHEMATICAL PROGRAMMING
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- (2013) Amir Ali Ahmadi et al. SIAM JOURNAL ON OPTIMIZATION
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- (2012) V. Jeyakumar et al. OPERATIONS RESEARCH LETTERS
- A convex polynomial that is not sos-convex
- (2011) Amir Ali Ahmadi et al. MATHEMATICAL PROGRAMMING
- Polynomial Matrix Inequality and Semidefinite Representation
- (2011) Jiawang Nie MATHEMATICS OF OPERATIONS RESEARCH
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- (2011) D. H. Fang et al. SIAM JOURNAL ON OPTIMIZATION
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- (2010) V. Jeyakumar et al. OPERATIONS RESEARCH LETTERS
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- (2009) N. Dinh et al. MATHEMATICAL PROGRAMMING
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- (2009) Jean B. Lasserre SIAM JOURNAL ON OPTIMIZATION
- Semidefinite representation of convex sets
- (2008) J. William Helton et al. MATHEMATICAL PROGRAMMING
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search