Pages that link to "Item:Q1856388"
From MaRDI portal
The following pages link to Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications (Q1856388):
Displayed 50 items.
- Towards global bilevel dynamic optimization (Q842715) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- An efficient and safe framework for solving optimization problems (Q861905) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← 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)
- A method for approximating pairwise comparison matrices by consistent matrices (Q956601) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem (Q1001331) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← 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)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- A new Lagrangean approach to the pooling problem (Q1037357) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Minimal surface convex hulls of spheres (Q1633782) (← links)
- Petroleum refinery optimization (Q1642991) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- A global optimization for sustainable multi-domain global manufacturing (Q1652480) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Complexity analysis and algorithm design of pooling problem (Q1660293) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification (Q1678576) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- Algorithms for generalized potential games with mixed-integer variables (Q1694402) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)