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)

The Rank-One Quadratic Assignment Problem
Convergence-order analysis of branch-and-bound algorithms for constrained problems
Operational decisions for multi-period industrial gas pipeline networks under uncertainty
Convex and concave envelopes: revisited and new perspectives
Bilevel optimization to deal with demand response in power grids: models, methods and challenges
Valid inequalities for quadratic optimisation with domain constraints
Robust maximum capture facility location under random utility maximization models
Optimal deterministic algorithm generation
Interpolation-based model order reduction for polynomial systems
Lifting convex inequalities for bipartite bilinear programs
Lifting convex inequalities for bipartite bilinear programs
Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
A note on linearized reformulations for a class of bilevel linear integer problems
A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
New models for the location of controversial facilities: a bilevel programming approach
Probabilistic partial set covering with an oracle for chance constraints
Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
Deriving convex hulls through lifting and projection
A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting
Safe and tight linear estimators for global optimization
Distance geometry and data science
Linear transformation based solution methods for non-convex mixed integer quadratic programs
A fair division approach to humanitarian logistics inspired by conditional value-at-risk
A general branch-and-bound framework for continuous global multiobjective optimization
Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
Approximating two-stage chance-constrained programs with classical probability bounds
A class of valid inequalities for multilinear 0-1 optimization problems
Optimal defense against election control by deleting voter groups
Cutting plane generation through sparse principal component analysis
Ordered \(p\)-median problems with neighbourhoods
Network design in scarce data environment using moment-based distributionally robust optimization
Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage
Stochastic maximum flow interdiction problems under heterogeneous risk preferences
An improved univariate global optimization algorithm with improved linear lower bounding functions
EAGO.jl: easy advanced global optimization in Julia
A new two-level linear relaxed bound method for geometric programming problems
Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
Experimental validation of volume-based comparison for double-McCormick relaxations
Editorial: Reformulation techniques in mathematical programming
Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
Global optimization of linear hybrid systems with explicit transitions
The cluster problem in constrained global optimization
Comparison of deterministic and stochastic approaches to global optimization
Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
Balancing efficiency and equity in location-allocation models with an application to strategic EMS design
On linear programming relaxations for solving polynomial programming problems
Mathematical programming formulations for the alternating current optimal power flow problem
Mathematical programming formulations for the alternating current optimal power flow problem
Linear programing relaxations for a strategic pricing problem in electricity markets
Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
Computationally relevant generalized derivatives: theory, evaluation and applications
Title not available (Why is that?)
A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Nonlinear separation of data via mixed 0-1 integer and linear programming
Convex envelopes for ray-concave functions
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

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)