Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

Cites Work

An Algorithm for Separable Nonconvex Programming Problems
An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints

Cited In (only showing first 100 items - show all)

Solving linear programs with complementarity constraints using branch-and-cut
Linear Reformulations of Integer Quadratic Programs
Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
Improved relaxations for the parametric solutions of ODEs using differential inequalities
Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
Semidefinite relaxations for non-convex quadratic mixed-integer programming
Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
Global optimization of bilinear programs with a multiparametric disaggregation technique
Extended reverse-convex programming: an approximate enumeration approach to global optimization
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
New methods for calculating \(\alpha\)BB-type underestimators
Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation
Global optimization algorithms for linearly constrained indefinite quadratic problems
Global optimization with spline constraints: a new branch-and-bound method based on B-splines
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
A polyhedral branch-and-cut approach to global optimization
Convex envelopes generated from finitely many compact convex sets
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
Explicit convex and concave envelopes through polyhedral subdivisions
Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
Non polyhedral convex envelopes for 1-convex functions
A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
A practicable branch and bound algorithm for sum of linear ratios problem
Extending the QCR method to general mixed-integer programs
Convex envelopes of products of convex and component-wise concave functions
Calculation of bounds on variables satisfying nonlinear inequality constraints
Extended formulations for convex envelopes
Constraint aggregation for rigorous global optimization
The computational complexity of the pooling problem
An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
A new Lagrangean approach to the pooling problem
Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
Interval analysis on directed acyclic graphs for global optimization
Multi-parametric disaggregation technique for global optimization of polynomial programming problems
Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster
GLOMIQO: global mixed-integer quadratic optimizer
Global solution of semi-infinite programs
Existence and sum decomposition of vertex polyhedral convex envelopes
A branch-and-reduce approach to global optimization
Global optimization of mixed-integer signomial programming problems
ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
Global optimization with nonlinear ordinary differential equations
A hybrid LP/NLP paradigm for global optimization relaxations
Bidimensional packing by bilinear programming
Reformulation in mathematical programming: An application to quantum chemistry
Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
Univariate parameterization for global optimization of mixed-integer polynomial problems
Minotaur: a mixed-integer nonlinear optimization toolkit
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
Convex envelopes for edge-concave functions
Analysis of MILP techniques for the pooling problem
Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets
Nonlinear convex and concave relaxations for the solutions of parametric ODEs
Decomposition strategy for the stochastic pooling problem
BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
How to solve a semi-infinite optimization problem
Rounding-based heuristics for nonconvex MINLPS
A rigorous global filtering algorithm for quadratic constraints
A global optimization algorithm for linear fractional and bilinear programs
A matheuristic approach for optimizing mineral value chains under uncertainty
A multi-commodity flow formulation for the generalized pooling problem
Strong formulations for the pooling problem
Some results on the strength of relaxations of multilinear functions
On convex relaxations of quadrilinear terms
A technique to derive the analytical form of convex envelopes for some bivariate functions
A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
A gentle, geometric introduction to copositive optimization
Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
Algorithms for an integer multicommodity network flow problem with node reliability considerations
Global optimization of general nonconvex problems with intermediate polynomial substructures
Multivariate McCormick relaxations
Solving chance-constrained optimization problems with stochastic quadratic inequalities
Algorithmic differentiation techniques for global optimization in the COCONUT environment
Bound reduction using pairs of linear inequalities
Large-scale standard pooling problems with constrained pools and fixed demands
Mixed integer nonlinear programming tools: an updated practical overview
Global optimization in stabilizing controller design
Convergent upper bounds in global minimization with nonlinear equality constraints
Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
Alternative branching rules for some nonconvex problems
Valid Inequalities for the Pooling Problem with Binary Variables
Linearity embedded in nonconvex programs
Design of planar articulated mechanisms using branch and bound
An all-linear programming relaxation algorithm for optimizing over the efficient set
A branch-and-cut algorithm for mixed-integer bilinear programming

This page was built for publication: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120313)