Convex extensions and envelopes of lower semi-continuous functions
From MaRDI portal
Publication:1396213
DOI10.1007/s10107-002-0308-zzbMath1065.90062OpenAlexW1998221953MaRDI QIDQ1396213
Mohit Tawarmalani, Nikolaos V. Sahinidis
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0308-z
Related Items
A review of recent advances in global optimization, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Solving generalized polynomial problem by using new affine relaxed technique, Perspective Reformulations of the CTA Problem with L2 Distances, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Tractable Relaxations of Composite Functions, Tight convex relaxations for the expansion planning problem, Error bounds for monomial convexification in polynomial optimization, Stochastic dual dynamic integer programming, A computational study of perspective cuts, Optimising portfolio diversification and dimensionality, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Globally optimal algorithms for stratified autocalibration, Outer-product-free sets for polynomial optimization and oracle-based cuts, Convex envelopes generated from finitely many compact convex sets, Domain reduction techniques for global NLP and MINLP optimization, Convex envelopes of products of convex and component-wise concave functions, Explicit convex and concave envelopes through polyhedral subdivisions, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, A review of deterministic optimization methods in engineering and management, Convex underestimators of polynomials, On convex relaxations of quadrilinear terms, Relaxations of factorable functions with convex-transformable intermediates, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, Extended formulations for convex envelopes, Convex underestimation for posynomial functions of positive variables, Existence and sum decomposition of vertex polyhedral convex envelopes, A new framework to relax composite functions in nonlinear programs, Global optimization in stabilizing controller design, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Two new reformulation convexification based hierarchies for 0-1 MIPs, Multivariate McCormick relaxations, Global optimization of general nonconvex problems with intermediate polynomial substructures, Convergence analysis of multivariate McCormick relaxations, Global optimization of nonconvex problems with convex-transformable intermediates, Perspective cuts for a class of convex 0-1 mixed integer programs, Global optimization of general non-convex problems with intermediate bilinear substructures, Tuning BARON using derivative-free optimization algorithms, On tightness and anchoring of McCormick and other relaxations, Convex envelopes for edge-concave functions, A polyhedral branch-and-cut approach to global optimization, Experiments on virtual private network design with concave capacity costs, Performance of convex underestimators in a branch-and-bound framework, On the weak convergence of Monge-Ampère measures for discrete convex mesh functions, Reformulations in Mathematical Programming: Definitions and Systematics, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, On the Composition of Convex Envelopes for Quadrilinear Terms, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Collusive game solutions via optimization, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Non-convex nested Benders decomposition, Delay-constrained shortest paths: approximation algorithms and second-order cone models, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, Approximated perspective relaxations: a project and lift approach
