Pages that link to "Item:Q1396213"
From MaRDI portal
The following pages link to Convex extensions and envelopes of lower semi-continuous functions (Q1396213):
Displaying 50 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Globally optimal algorithms for stratified autocalibration (Q408824) (← links)
- Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Convex underestimation for posynomial functions of positive variables (Q941023) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
- Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- On the weak convergence of Monge-Ampère measures for discrete convex mesh functions (Q2042533) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
- Non-convex nested Benders decomposition (Q2097672) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- Multivariate McCormick relaxations (Q2250101) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
- Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
- Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Stochastic dual dynamic integer programming (Q2414913) (← links)
- Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
- Global optimization in stabilizing controller design (Q2465481) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- Collusive game solutions via optimization (Q2576729) (← links)
