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)

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
Reformulations in Mathematical Programming: Definitions and Systematics
A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
Rigorous filtering using linear relaxations
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Piecewise-linear approximations of multidimensional functions
Fair transfer price and inventory holding policies in two-enterprise supply chains
A new linearization method for quadratic assignment problems
Modified modularity density maximization and density ratio heuristic
A parametric branch and bound approach to suboptimal explicit hybrid MPC
Solving Quadratic Programming by Cutting Planes
On the Composition of Convex Envelopes for Quadrilinear Terms
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty
Optimal mapping of cloud virtual machines
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
A framework for globally optimizing mixed-integer signomial programs
Stochastic dual dynamic programming applied to nonconvex hydrothermal models
An improved decomposition-based heuristic to design a water distribution network for an irrigation system
Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
Natural gas production network infrastructure development under uncertainty
A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
Global optimization of general non-convex problems with intermediate bilinear substructures
Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
Convergence rate of McCormick relaxations
Generalized McCormick relaxations
Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
The cluster problem revisited
Towards global bilevel dynamic optimization
A non-parametric approach to demand forecasting in revenue management
A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
Divisive heuristic for modularity density maximization
Optimizing the ecological connectivity of landscapes
Global optimization of generalized semi-infinite programs via restriction of the right hand side
Truss topology optimization with discrete design variables by outer approximation
Reduction constraints for the global optimization of NLPs
On hub location problems in geographically flexible networks
Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
Nonsmooth exclusion test for finding all solutions of nonlinear equations
Generation of networks with prescribed degree-dependent clustering
Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
A cost minimization heuristic for the pooling problem
Globally optimal algorithms for stratified autocalibration
Convergence analysis of Taylor models and McCormick-Taylor models
On the global solution of multi-parametric mixed integer linear programming problems
Interval bounds on the solutions of semi-explicit index-one DAEs. I: Analysis
Interval bounds on the solutions of semi-explicit index-one DAEs. II: Computation
Simultaneous location of trauma centers and helicopters for emergency medical service planning
A decomposition-based heuristic for collaborative scheduling in a network of open-pit mines
Planning for HIV screening, testing, and care at the veterans health administration
Obtaining tighter relaxations of mathematical programs with complementarity constraints
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
Global solution of optimization problems with parameter-embedded linear dynamic systems.
Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
Distributionally robust facility location problem under decision-dependent stochastic demand
Global optimization of bounded factorable functions with discontinuities
Algorithms for parametric nonconvex programming
On the strength of recursive McCormick relaxations for binary polynomial optimization
Machine learning for combinatorial optimization: a methodological tour d'horizon
Mixed integer nonlinear programming tools: a practical overview
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
Interactions between nonlinear programming and modeling systems
Mathematical programming models and exact algorithms
A mean-risk mixed integer nonlinear program for transportation network protection
A survey of adjustable robust optimization
Stable set-valued integration of nonlinear dynamic systems using affine set-parameterizations
Global optimization of Hölder functions
Unbounded convex sets for non-convex mixed-integer quadratic programming
Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management
A branch and bound method for the solution of multiparametric mixed integer linear programming problems
Convex envelopes of bivariate functions through the solution of KKT systems
Optimization methods for decision making in disease prevention and epidemic control
Global optimization of nonconvex problems with multilinear intermediates
Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
Convex and concave relaxations of implicit functions
Extensions on ellipsoid bounds for quadratic integer programming
Experiments on virtual private network design with concave capacity costs
Global minimum test problem construction
\(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
On handling indicator constraints in mixed integer programming
Improved convex and concave relaxations of composite bilinear forms
Second-order sensitivity analysis in factorable programming: Theory and applications
Disjunctive Cuts for Nonconvex MINLP

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)