Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
From MaRDI portal
Publication:4120313
Cites work
Cited in
(only showing first 100 items - show all)- Algorithms for parametric nonconvex programming
- Global optimization of bounded factorable functions with discontinuities
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Constrained global optimization for wine blending
- Global optimization in stabilizing controller design
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Operational decisions for multi-period industrial gas pipeline networks under uncertainty
- Structured interpolation for multivariate transfer functions of quadratic-bilinear systems
- The Rank-One Quadratic Assignment Problem
- Production planning and scheduling in mining scenarios under IPCC mining systems
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- Generalized quadratic embeddings for nonlinear dynamics using deep learning
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Mixed integer nonlinear programming tools: a practical overview
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Reachability analysis and deterministic global optimization of DAE models
- Interactions between nonlinear programming and modeling systems
- Convex and concave envelopes: revisited and new perspectives
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Bilevel optimization to deal with demand response in power grids: models, methods and challenges
- Solving linear programs with complementarity constraints using branch-and-cut
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model
- Relaxations of factorable functions with convex-transformable intermediates
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs
- The bipartite Boolean quadric polytope
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
- Linear Reformulations of Integer Quadratic Programs
- Integrated multi-site aggregate production-pricing planning in a two-echelon supply chain with multiple demand classes
- Valid inequalities for quadratic optimisation with domain constraints
- Mathematical programming models and exact algorithms
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- Alternative branching rules for some nonconvex problems
- Mathematical programming for simultaneous feature selection and outlier detection under l1 norm
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem
- Data-driven optimization for seismic-resilient power network planning
- Valid Inequalities for the Pooling Problem with Binary Variables
- Optimal design and dispatch of a hybrid microgrid system capturing battery fade
- Robust newsvendor problems with compound Poisson demands
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- A mean-risk mixed integer nonlinear program for transportation network protection
- Data‐driven predictive control for a class of uncertain control‐affine systems
- Robust maximum capture facility location under random utility maximization models
- A survey of adjustable robust optimization
- Optimal deterministic algorithm generation
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Complete mixed integer linear programming formulations for modularity density based clustering
- Linearity embedded in nonconvex programs
- Fortification Against Cascade Propagation Under Uncertainty
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)
- Interpolation-based model order reduction for polynomial systems
- Tighter McCormick relaxations through subgradient propagation
- A doubly nonnegative relaxation for modularity density maximization
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Maximal quadratic-free sets
- On generalized surrogate duality in mixed-integer nonlinear programming
- Introduction to QUBO
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Stable set-valued integration of nonlinear dynamic systems using affine set-parameterizations
- Global optimization of Hölder functions
- Design of planar articulated mechanisms using branch and bound
- Optimal design of line replaceable units
- Service center location problems with decision dependent utilities and a pandemic case study
- Maximal quadratic-free sets
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
- Bilevel knapsack with interdiction constraints
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- A branch and bound method for the solution of multiparametric mixed integer linear programming problems
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Graph, clique and facet of Boolean logical polytope
- A new framework to relax composite functions in nonlinear programs
- Cardinality minimization, constraints, and regularization: a survey
- Distributionally robust joint chance-constrained programming with Wasserstein metric
- An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- Learn and route: learning implicit preferences for vehicle routing
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)
