Pages that link to "Item:Q4120313"
From MaRDI portal
The following pages link to Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (Q4120313):
Displaying 50 items.
- Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Generalized McCormick relaxations (Q656963) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs (Q670661) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- Global solution of optimization problems with parameter-embedded linear dynamic systems. (Q703168) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- New methods for calculating \(\alpha\)BB-type underestimators (Q742131) (← links)
- The cluster problem revisited (Q742132) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- BranchHull: convex bilinear inversion from the entrywise product of signals with known signs (Q778035) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- On the convexification of nonlinear programming problems: An applications-oriented survey (Q799590) (← links)
- Global multi-parametric optimal value bounds and solution estimates for separable parametric programs (Q804476) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations (Q811878) (← links)
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
- Interval analysis on directed acyclic graphs for global optimization (Q816066) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
- Bilevel optimization to deal with demand response in power grids: models, methods and challenges (Q828745) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Explicit hybrid model-predictive control: the exact solution (Q895283) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Nonlinear separation of data via mixed 0-1 integer and linear programming (Q990586) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← 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)
- Editorial: Reformulation techniques in mathematical programming (Q1025983) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- A new Lagrangean approach to the pooling problem (Q1037357) (← links)
