A new technique to derive tight convex underestimators (sometimes envelopes)
Published 2023 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A new technique to derive tight convex underestimators (sometimes envelopes)
Authors
Keywords
-
Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2023-10-17
DOI
10.1007/s10589-023-00534-8
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- The generalized trust region subproblem: solution complexity and convex hull results
- (2020) Alex L. Wang et al. MATHEMATICAL PROGRAMMING
- Convex envelopes of bivariate functions through the solution of KKT systems
- (2018) Marco Locatelli JOURNAL OF GLOBAL OPTIMIZATION
- Deriving convex hulls through lifting and projection
- (2017) Trang T. Nguyen et al. MATHEMATICAL PROGRAMMING
- Convex and concave envelopes: Revisited and new perspectives
- (2017) Walid Ben-Ameur et al. OPERATIONS RESEARCH LETTERS
- Non polyhedral convex envelopes for 1-convex functions
- (2016) Marco Locatelli JOURNAL OF GLOBAL OPTIMIZATION
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- (2013) V. Jeyakumar et al. MATHEMATICAL PROGRAMMING
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- (2013) Aharon Ben-Tal et al. MATHEMATICAL PROGRAMMING
- Convex underestimators of polynomials
- (2012) Jean B. Lasserre et al. JOURNAL OF GLOBAL OPTIMIZATION
- Explicit convex and concave envelopes through polyhedral subdivisions
- (2012) Mohit Tawarmalani et al. MATHEMATICAL PROGRAMMING
- Convex envelopes of products of convex and component-wise concave functions
- (2011) Aida Khajavirad et al. JOURNAL OF GLOBAL OPTIMIZATION
- Generalized McCormick relaxations
- (2011) Joseph K. Scott et al. JOURNAL OF GLOBAL OPTIMIZATION
- Convergence rate of McCormick relaxations
- (2011) Agustín Bompadre et al. JOURNAL OF GLOBAL OPTIMIZATION
- NP-hardness of deciding convexity of quartic polynomials and related problems
- (2011) Amir Ali Ahmadi et al. MATHEMATICAL PROGRAMMING
- Convex envelopes generated from finitely many compact convex sets
- (2011) Aida Khajavirad et al. MATHEMATICAL PROGRAMMING
- Semidefinite representation of convex sets
- (2008) J. William Helton et al. MATHEMATICAL PROGRAMMING
- The Convex Envelope of (n–1)-Convex Functions
- (2008) Matthias Jach et al. SIAM JOURNAL ON OPTIMIZATION
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