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
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

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)