Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
From MaRDI portal
Publication:4120313
DOI10.1007/BF01580665zbMath0349.90100WikidataQ92190518 ScholiaQ92190518MaRDI QIDQ4120313
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Robust parameter design and optimization for quality engineering ⋮ Graph, clique and facet of Boolean logical polytope ⋮ Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems ⋮ Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ A combinatorial optimization approach to scenario filtering in portfolio selection ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ A matheuristic approach for optimizing mineral value chains under uncertainty ⋮ Computing equilibria for integer programming games ⋮ A mixed integer linear programming algorithm for plasmid binning ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs ⋮ Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints ⋮ Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ Global dynamic optimization using edge-concave underestimator ⋮ Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization ⋮ A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ Distance geometry and data science ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Deterministic global optimization of steam cycles using the IAPWS-IF97 model ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Wasserstein distributionally robust chance-constrained optimization for energy and reserve dispatch: an exact and physically-bounded formulation ⋮ A robust decision-support method based on optimization and simulation for wildfire resilience in highly renewable power systems ⋮ Robust newsvendor problems with compound Poisson demands ⋮ Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique ⋮ Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution ⋮ Algorithms for an integer multicommodity network flow problem with node reliability considerations ⋮ Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets ⋮ Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems ⋮ Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ A branch and bound method for the solution of multiparametric mixed integer linear programming problems ⋮ Multivariate McCormick relaxations ⋮ Global optimization of general nonconvex problems with intermediate polynomial substructures ⋮ Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization ⋮ A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation ⋮ How to solve a semi-infinite optimization problem ⋮ A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems ⋮ A conic relaxation model for searching for the global optimum of network data envelopment analysis ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation ⋮ On convex envelopes and regularization of non-convex functionals without moving global minima ⋮ An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ Optimal influenza vaccine distribution with equity ⋮ Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ Closing the gap in linear bilevel optimization: a new valid primal-dual inequality ⋮ Production planning and scheduling in mining scenarios under IPCC mining systems ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems ⋮ Integrated multi-site aggregate production-pricing planning in a two-echelon supply chain with multiple demand classes ⋮ Convexification techniques for linear complementarity constraints ⋮ Linearization of McCormick relaxations and hybridization with the auxiliary variable method ⋮ Convex hull representations for bounded products of variables ⋮ A doubly nonnegative relaxation for modularity density maximization ⋮ Convex envelope of bivariate cubic functions over rectangular regions ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games ⋮ The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling ⋮ Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case ⋮ Deterministic global optimization with Gaussian processes embedded ⋮ Convex hull representations of special monomials of binary variables ⋮ Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes ⋮ Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming ⋮ Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization ⋮ Identification of mechanical properties of arteries with certification of global optimality ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ Decision programming for mixed-integer multi-stage optimization under uncertainty ⋮ Global dynamic optimization with Hammerstein-Wiener models embedded ⋮ Convex envelopes for ray-concave functions ⋮ Optimal design and dispatch of a hybrid microgrid system capturing battery fade ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ A second-order cone model of transmission planning with alternating and direct current lines ⋮ Approximating two-stage chance-constrained programs with classical probability bounds ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities ⋮ Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization ⋮ Operational decisions for multi-period industrial gas pipeline networks under uncertainty ⋮ Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints ⋮ Discretization and global optimization for mixed integer bilinear programming ⋮ AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization ⋮ On the separation of split inequalities for non-convex quadratic integer programming ⋮ SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs ⋮ Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations ⋮ Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets ⋮ Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty ⋮ Modified modularity density maximization and density ratio heuristic ⋮ A gentle, geometric introduction to copositive optimization ⋮ Global optimization for the multilevel European gas market system with nonlinear flow models on trees ⋮ Lift \& learn: physics-informed machine learning for large-scale nonlinear dynamical systems ⋮ Optimized Bonferroni approximations of distributionally robust joint chance constraints ⋮ On generalized surrogate duality in mixed-integer nonlinear programming ⋮ Maximal quadratic-free sets ⋮ Transmission Capacity Allocation in Zonal Electricity Markets ⋮ COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS ⋮ EAGO.jl: easy advanced global optimization in Julia ⋮ Learning physics-based models from data: perspectives from inverse problems and model reduction ⋮ Maximal Quadratic-Free Sets ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Binary Optimal Control of Single-Flux-Quantum Pulse Sequences ⋮ Balanced Truncation Model Reduction for Lifted Nonlinear Systems ⋮ Introduction to QUBO ⋮ Mathematical Programming Models and Exact Algorithms ⋮ Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Managing Product Transitions: A Bilevel Programming Approach ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Tractable Relaxations of Composite Functions ⋮ The Rank-One Quadratic Assignment Problem ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management ⋮ Constrained multi‐location assortment optimization under the multinomial logit model ⋮ Inductive linearization for binary quadratic programs with linear constraints ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ Towards global parameter estimation exploiting reduced data sets ⋮ Optimizing edge sets in networks to produce ground truth communities based on modularity ⋮ Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation ⋮ Computational comparisons of different formulations for the Stackelberg minimum spanning tree game ⋮ On hub location problems in geographically flexible networks ⋮ A robust biobjective optimization approach for operating a shared energy storage under price uncertainty ⋮ Efficient separation of RLT cuts for implicit and explicit bilinear products ⋮ Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches ⋮ Optimization problems involving matrix multiplication with applications in materials science and biology ⋮ Limiting flexibility in nonparametric efficiency evaluations: an ex post \(k\)-centroid clustering approach ⋮ Future memories are not needed for large classes of POMDPs ⋮ Exclusion tendency-based observer design framework for active fault diagnosis ⋮ Robust maximum capture facility location under random utility maximization models ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Robust flows with adaptive mitigation ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ (Global) optimization: historical notes and recent developments ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ Topology optimization of adaptive structures: new limits of material economy ⋮ Structured interpolation for multivariate transfer functions of quadratic-bilinear systems ⋮ Data‐driven predictive control for a class of uncertain control‐affine systems ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ Service center location problems with decision dependent utilities and a pandemic case study ⋮ Optimal design of line replaceable units ⋮ Learn and route: learning implicit preferences for vehicle routing ⋮ On the strength of recursive McCormick relaxations for binary polynomial optimization ⋮ Wasserstein distributionally robust chance-constrained program with moment information ⋮ A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing ⋮ Extended McCormick relaxation rules for handling empty arguments representing infeasibility ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ Real-time dispatch optimization for concentrating solar power with thermal energy storage ⋮ General convex relaxations of implicit functions and inverse functions ⋮ Subdomain separability in global optimization ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ Mitigating Interdiction Risk with Fortification ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Toward Computing the Margin of Victory in Single Transferable Vote Elections ⋮ An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints ⋮ Interpolation-Based Model Order Reduction for Polynomial Systems ⋮ Communication-Constrained Expansion Planning for Resilient Distribution Systems ⋮ Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs ⋮ Global optimization of general non-convex problems with intermediate bilinear substructures ⋮ Constraint aggregation for rigorous global optimization ⋮ Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport ⋮ Performance of convex underestimators in a branch-and-bound framework ⋮ Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment ⋮ The computational complexity of the pooling problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Preface ⋮ An exact algorithm for robust influence maximization ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Conflict Analysis for MINLP ⋮ Semidefinite Programming and Nash Equilibria in Bimatrix Games ⋮ Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms ⋮ Stability Domains for Quadratic-Bilinear Reduced-Order Models ⋮ Two-Sided Projection Methods for Nonlinear Model Order Reduction ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ A global optimization algorithm for linear fractional and bilinear programs ⋮ A fair division approach to humanitarian logistics inspired by conditional value-at-risk ⋮ Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations ⋮ Deriving convex hulls through lifting and projection ⋮ Optimal defense against election control by deleting voter groups ⋮ Second-order sensitivity analysis in factorable programming: Theory and applications ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ Interactions between nonlinear programming and modeling systems ⋮ On decomposability of multilinear sets ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Global optimization of MIQCPs with dynamic piecewise relaxations ⋮ An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ Global optimization algorithm for capacitated multi-facility continuous location-allocation problems ⋮ Optimal deterministic algorithm generation ⋮ Global optimization of Hölder functions ⋮ An improved univariate global optimization algorithm with improved linear lower bounding functions ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ Chebyshev model arithmetic for factorable functions ⋮ Strong valid inequalities for Boolean logical pattern generation ⋮ A branch-and-reduce approach to global optimization ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Some results on the strength of relaxations of multilinear functions ⋮ Decomposition strategy for the stochastic pooling problem ⋮ The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm ⋮ A mean-risk mixed integer nonlinear program for transportation network protection ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ The cluster problem in constrained global optimization ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon ⋮ Convex quadratic relaxations for mixed-integer nonlinear programs in power systems ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ Robust multicriteria risk-averse stochastic programming models ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations ⋮ Algorithms for parametric nonconvex programming ⋮ On convex relaxations of quadrilinear terms ⋮ Global optimization in Hilbert space ⋮ Convex and concave envelopes: revisited and new perspectives ⋮ A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ New models for the location of controversial facilities: a bilevel programming approach ⋮ Power-to-chemicals: a superstructure problem for sustainable syngas production ⋮ A survey of adjustable robust optimization ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ New solution approaches for the maximum-reliability stochastic network interdiction problem ⋮ A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting ⋮ The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ Complete mixed integer linear programming formulations for modularity density based clustering ⋮ Easy and optimal queries to reduce set uncertainty ⋮ A new lift-and-project operator ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Modeling the steering of international roaming traffic ⋮ A parametric successive underestimation method for convex multiplicative programming problems ⋮ On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem ⋮ Calculation of bounds on variables satisfying nonlinear inequality constraints ⋮ Rounding-based heuristics for nonconvex MINLPS ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ Experimental validation of volume-based comparison for double-McCormick relaxations ⋮ Public R\&D project portfolio selection problem with cancellations ⋮ Safe and tight linear estimators for global optimization ⋮ A rigorous global filtering algorithm for quadratic constraints ⋮ A new two-level linear relaxed bound method for geometric programming problems ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ Data-driven distributionally robust chance-constrained optimization with Wasserstein metric ⋮ Convex envelopes for edge-concave functions ⋮ A polyhedral branch-and-cut approach to global optimization ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Global solution of semi-infinite programs ⋮ Design of planar articulated mechanisms using branch and bound ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles ⋮ An integer linear programming approach for a class of bilinear integer programs ⋮ Railway delay management with passenger rerouting considering train capacity constraints ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem ⋮ Distributionally robust facility location problem under decision-dependent stochastic demand ⋮ Enhancing numerical constraint propagation using multiple inclusion representations ⋮ Fair transfer price and inventory holding policies in two-enterprise supply chains ⋮ A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization ⋮ The polyadic structure of factorable function tensors with applications to high-order minimization techniques ⋮ A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set ⋮ Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations ⋮ Natural gas production network infrastructure development under uncertainty ⋮ Linear transformation based solution methods for non-convex mixed integer quadratic programs ⋮ Three ideas for a feasibility pump for nonconvex MINLP ⋮ Algorithmic differentiation techniques for global optimization in the COCONUT environment ⋮ Disjunctive Cuts for Nonconvex MINLP ⋮ Global Optimization of Mixed-Integer Signomial Programming Problems ⋮ On handling indicator constraints in mixed integer programming ⋮ Balancing efficiency and equity in location-allocation models with an application to strategic EMS design ⋮ Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach ⋮ Unnamed Item ⋮ Planning for HIV Screening, Testing, and Care at the Veterans Health Administration ⋮ Analysis of MILP Techniques for the Pooling Problem ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations ⋮ Strong valid inequalities for orthogonal disjunctions and bilinear covering sets ⋮ Bilevel Knapsack with Interdiction Constraints ⋮ Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems ⋮ A general framework for convexity analysis in deterministic global optimization ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ A multi-commodity flow formulation for the generalized pooling problem ⋮ Bound reduction using pairs of linear inequalities ⋮ Strong formulations for the pooling problem ⋮ Deterministic global optimization in ab-initio quantum chemistry ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ Stable Set-Valued Integration of Nonlinear Dynamic Systems using Affine Set-Parameterizations ⋮ Constrained global optimization for wine blending ⋮ Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning ⋮ Piecewise polyhedral formulations for a multilinear term ⋮ A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ Towards understanding sensor and control nodes selection in nonlinear dynamic systems: Lyapunov theory meets branch-and-bound ⋮ The outcome range problem in interval linear programming ⋮ Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Alternative branching rules for some nonconvex problems ⋮ Convex and concave relaxations of implicit functions ⋮ A Bayesian framework for molecular strain identification from mixed diagnostic samples ⋮ Tight convex relaxations for the expansion planning problem ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ The bipartite Boolean quadric polytope ⋮ A computational study on QP problems with general linear constraints ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Covid-19 PPE distribution planning with demand priorities and supply uncertainties ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs ⋮ Strong SOCP Relaxations for the Optimal Power Flow Problem ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Facets of a mixed-integer bilinear covering set with bounds on variables ⋮ Convex Relaxations for Gas Expansion Planning ⋮ Sensitivity Analysis of Uncertain Dynamic Systems Using Set-Valued Integration ⋮ A reformulation-linearization technique for optimization over simplices ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem ⋮ Linear programing relaxations for a strategic pricing problem in electricity markets ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ Optimization methods for decision making in disease prevention and epidemic control ⋮ Global optimization of bounded factorable functions with discontinuities ⋮ Unnamed Item ⋮ Relaxations of factorable functions with convex-transformable intermediates ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ Nonsmooth DAEs with Applications in Modeling Phase Changes ⋮ Solving Quadratic Programming by Cutting Planes ⋮ Whitney differentiability of optimal-value functions for bound-constrained convex programming problems ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Global optimization in stabilizing controller design ⋮ On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems ⋮ Valid Inequalities for the Pooling Problem with Binary Variables ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Reduction constraints for the global optimization of NLPs ⋮ Comparison of deterministic and stochastic approaches to global optimization ⋮ Improve-and-branch algorithm for the global optimization of nonconvex NLP problems ⋮ Global optimization with nonlinear ordinary differential equations ⋮ Global optimization of linear hybrid systems with explicit transitions ⋮ Computationally relevant generalized derivatives: theory, evaluation and applications ⋮ Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions ⋮ On the Performance of NLP Solvers Within Global MINLP Solvers ⋮ Reachability Analysis and Deterministic Global Optimization of DAE Models ⋮ A convexity-based homotopy method for nonlinear optimization in model predictive control ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ Linear Reformulations of Integer Quadratic Programs ⋮ Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model ⋮ Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization ⋮ A new linearization method for quadratic assignment problems ⋮ Global minimum test problem construction ⋮ Nonlinear convex and concave relaxations for the solutions of parametric ODEs ⋮ Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators ⋮ Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints ⋮ Linearity embedded in nonconvex programs ⋮ An algorithm for global solution to bi-parametric linear complementarity constrained linear programs ⋮ Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems ⋮ Global optimization of nonconvex problems with multilinear intermediates ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Effective algorithms for optimal portfolio deleveraging problem with cross impact ⋮ Optimizing the ecological connectivity of landscapes ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems ⋮ Exact approaches for competitive facility location with discrete attractiveness ⋮ Bilevel optimization to deal with demand response in power grids: models, methods and challenges ⋮ A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics ⋮ Extended reverse-convex programming: an approximate enumeration approach to global optimization ⋮ Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation ⋮ 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 ⋮ Towards global bilevel dynamic optimization ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty ⋮ Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Optimal mapping of cloud virtual machines ⋮ A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife ⋮ An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms ⋮ A non-parametric approach to demand forecasting in revenue management ⋮ Divisive heuristic for modularity density maximization ⋮ A convex optimization approach for solving the single-vehicle cyclic inventory routing problem ⋮ From quasidifferentiable to directed subdifferentiable functions: exact calculus rules ⋮ Convergence analysis of Taylor models and McCormick-Taylor models ⋮ Improved relaxations for the parametric solutions of ODEs using differential inequalities ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ 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 ⋮ Semidefinite relaxations for non-convex quadratic mixed-integer programming ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ Nonsmooth exclusion test for finding all solutions of nonlinear equations ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Explicit hybrid model-predictive control: the exact solution ⋮ Globally optimal algorithms for stratified autocalibration ⋮ Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks ⋮ Convex envelopes of products of convex and component-wise concave functions ⋮ Stochastic dual dynamic programming applied to nonconvex hydrothermal models ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Rigorous filtering using linear relaxations ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations ⋮ A parametric branch and bound approach to suboptimal explicit hybrid MPC ⋮ Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs ⋮ Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control ⋮ Convergence rate of McCormick relaxations ⋮ Generalized McCormick relaxations ⋮ An improved decomposition-based heuristic to design a water distribution network for an irrigation system ⋮ A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures ⋮ Extending the QCR method to general mixed-integer programs ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ Extended formulations for convex envelopes ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ Truss topology optimization with discrete design variables by outer approximation ⋮ A cost minimization heuristic for the pooling problem ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs ⋮ Reverse propagation of McCormick relaxations ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques ⋮ Relaxations and discretizations for the pooling problem ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ Differentiable McCormick relaxations ⋮ Three enhancements for optimization-based bound tightening ⋮ A computational approach to determine damage in infrastructure networks from outage reports ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Generation of networks with prescribed degree-dependent clustering ⋮ Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs ⋮ Piecewise-linear approximations of multidimensional functions ⋮ Global solution of optimization problems with parameter-embedded linear dynamic systems. ⋮ Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ Nonlinear separation of data via mixed 0-1 integer and linear programming ⋮ Experiments on virtual private network design with concave capacity costs ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ New methods for calculating \(\alpha\)BB-type underestimators ⋮ The cluster problem revisited ⋮ Bidimensional packing by bilinear programming ⋮ Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions ⋮ Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions ⋮ Editorial: Reformulation techniques in mathematical programming ⋮ Reformulation in mathematical programming: An application to quantum chemistry ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ A new Lagrangean approach to the pooling problem ⋮ BranchHull: convex bilinear inversion from the entrywise product of signals with known signs ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ On the convexification of nonlinear programming problems: An applications-oriented survey ⋮ Global multi-parametric optimal value bounds and solution estimates for separable parametric programs ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ Proof of convergence for a global optimization algorithm for problems with ordinary differential equations ⋮ A global optimization method, QBB, for twice-differentiable nonconvex optimization problem ⋮ Interval analysis on directed acyclic graphs for global optimization ⋮ Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Cites Work
