Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
From MaRDI portal
Publication:1856388
zbMath1031.90022MaRDI QIDQ1856388
Mohit Tawarmalani, Nikolaos V. Sahinidis
Publication date: 4 February 2003
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, A hybrid LP/NLP paradigm for global optimization relaxations, Bounding duality gap for separable problems with linear constraints, How to select a small set of diverse solutions to mixed integer programming problems, On structural decompositions of finite frames, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints, Minimal surface convex hulls of spheres, A review of recent advances in global optimization, Towards global bilevel dynamic optimization, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Petroleum refinery optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Linear programming models for a stochastic dynamic capacitated lot sizing problem, A global optimization for sustainable multi-domain global manufacturing, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, On linear programming relaxations for solving polynomial programming problems, An efficient and safe framework for solving optimization problems, How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results, On decomposability of multilinear sets, Complexity analysis and algorithm design of pooling problem, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Chebyshev model arithmetic for factorable functions, Guided dive for the spatial branch-and-bound, Constraint propagation on quadratic constraints, Three modeling paradigms in mathematical programming, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification, Global optimization of bilinear programs with a multiparametric disaggregation technique, Estimation of domains of attraction: A global optimization approach, Virtuous smoothing for global optimization, A framework for globally optimizing mixed-integer signomial programs, Study of multiscale global optimization based on parameter space partition, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, Algorithms for generalized potential games with mixed-integer variables, Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks, An LPCC approach to nonconvex quadratic programs, Combinatorial integral approximation, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, Modern tools for the time-discrete dynamics and optimization of gene-environment networks, Energy-optimal multi-goal motion planning for planar robot manipulators, Convergence rate of McCormick relaxations, Generalized McCormick relaxations, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, 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, Optimal rank-sparsity decomposition, Optimization methods for mixed integer weakly concave programming problems, A cost minimization heuristic for the pooling problem, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, Existence and sum decomposition of vertex polyhedral convex envelopes, Global optimization of generalized semi-infinite programs using disjunctive programming, Reverse propagation of McCormick relaxations, Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem, Computing feasible points for binary MINLPs with MPECs, 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, Packing ellipsoids into volume-minimizing rectangular boxes, Two new reformulation convexification based hierarchies for 0-1 MIPs, A polynomially solvable case of the pooling problem, Relaxations and discretizations for the pooling problem, Computing equilibria of Cournot oligopoly models with mixed-integer quantities, A method for approximating pairwise comparison matrices by consistent matrices, Time-optimal velocity planning by a bound-tightening technique, Differentiable McCormick relaxations, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, Convergence analysis of multivariate McCormick relaxations, New multi-commodity flow formulations for the pooling problem, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Global optimization of nonconvex problems with convex-transformable intermediates, Decomposition-based inner- and outer-refinement algorithms for global optimization, Computational optimization of gas compressor stations: MINLP models versus continuous reformulations, An approach to constrained global optimization based on exact penalty functions, Algebraic modeling for IP and MIP (GAMS), Piecewise-linear approximations of multidimensional functions, Nonlinear dynamic systems design based on the optimization of the domain of attraction, Safe and tight linear estimators for global optimization, A polyhedral branch-and-cut approach to global optimization, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, A comparison of complete global optimization solvers, Reformulations for utilizing separability when solving convex MINLP problems, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, New methods for calculating \(\alpha\)BB-type underestimators, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, Global solution of bilevel programs with a nonconvex inner program, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Fast construction of constant bound functions for sparse polynomials, Cutting circles and polygons from area-minimizing rectangles, A new Lagrangean approach to the pooling problem, Enhancing numerical constraint propagation using multiple inclusion representations, Solving planning and design problems in the process industry using mixed integer and global optimization, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, EAGO.jl: easy advanced global optimization in Julia, Optimal design of multivariate acceptance sampling plans by variables, On Convex Hulls of Epigraphs of QCQPs, Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems, Solving generalized polynomial problem by using new affine relaxed technique, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Optimal three-part tariff pricing with Spence-Mirrlees reservation prices, Modeling design and control problems involving neural network surrogates, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Towards global parameter estimation exploiting reduced data sets, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, On the effectiveness of sequential linear programming for the pooling problem, Space splitting convexification: a local solution method for nonconvex optimal control problems, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Comparison of MINLP formulations for global superstructure optimization, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Strong Convex Nonlinear Relaxations of the Pooling Problem, Learning lyapunov functions for hybrid systems, The Convex Hull of a Quadratic Constraint over a Polytope, Solving Quadratic Programming by Cutting Planes, More Virtuous Smoothing, 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 of explicit strong-stability-preserving Runge-Kutta methods, Global solution of non-convex quadratically constrained quadratic programs, On the global minimization of the value-at-risk, Mathematically rigorous global optimization in floating-point arithmetic, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Strong mixed-integer programming formulations for trained neural networks, Global Optimization Toolbox for Maple: an introduction with illustrative applications, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Global Optimization Approaches to Sensor Placement: Model Versions and Illustrative Results, Natural gas production network infrastructure development under uncertainty, Unit-operation nonlinear modeling for planning and scheduling applications, A modified differential evolution based solution technique for economic dispatch problems, Three ideas for a feasibility pump for nonconvex MINLP, Algorithmic differentiation techniques for global optimization in the COCONUT environment, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Inversion of convection-diffusion equation with discrete sources, On the tightness of SDP relaxations of QCQPs, Disjunctive Cuts for Nonconvex MINLP, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, On handling indicator constraints in mixed integer programming, The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Sequence of polyhedral relaxations for nonlinear univariate functions, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Finding multiple solutions to general integer linear programs, A Deterministic Algorithm for Global Optimization, Large-scale standard pooling problems with constrained pools and fixed demands, A multi-commodity flow formulation for the generalized pooling problem, A DIRECT-type approach for derivative-free constrained global optimization, Tightening methods based on nontrivial bounds on bilinear terms, Strong relaxations for continuous nonlinear programs based on decision diagrams, Dual adaptive model predictive control, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, A piecewise linearization framework for retail shelf space management models, Decomposition strategy for the stochastic pooling problem, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, An efficient compact quadratic convex reformulation for general integer quadratic programs, An exact penalty global optimization approach for mixed-integer programming problems, Outer-product-free sets for polynomial optimization and oracle-based cuts, Generating valid linear inequalities for nonlinear programs via sums of squares, A deterministic approach to global box-constrained optimization, Benchmarking nonlinear optimization software in technical computing environments, Explicit convex and concave envelopes through polyhedral subdivisions, Some results on augmented Lagrangians in constrained global optimization via image space analysis, Unbounded convex sets for non-convex mixed-integer quadratic programming, Global optimization of bounded factorable functions with discontinuities, Global solution of nonlinear mixed-integer bilevel programs, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Deterministic global optimization of steam cycles using the IAPWS-IF97 model, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Nonlinear optimization with GAMS /LGO, Global optimization in stabilizing controller design, Valid Inequalities for the Pooling Problem with Binary Variables, Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks, Decision-dependent probabilities in stochastic programs with recourse, Global Optimization in Practice:State of the Art and Perspectives, Designing globally optimal delta-sigma modulator topologies via signomial programming, 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, Cutting ellipses from area-minimizing rectangles, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, Global optimization of general nonconvex problems with intermediate polynomial substructures, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, Target market selection and marketing effort under uncertainty: the selective newsvendor, High-order linear multistep methods with general monotonicity and boundedness properties, A primal heuristic for optimizing the topology of gas networks based on dual information, Tighter McCormick relaxations through subgradient propagation, Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems, Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests, Outer approximation for integer nonlinear programs via decision diagrams, On tightness and anchoring of McCormick and other relaxations, Optimal strong-stability-preserving time-stepping schemes with fast downwind spatial discretizations, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, QPLIB: a library of quadratic programming instances, Reachability Analysis and Deterministic Global Optimization of DAE Models, A general branch-and-bound framework for continuous global multiobjective optimization, Feasibility and cost minimisation for a lithium extraction problem, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On monotonicity and boundedness properties of linear multistep methods, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, A server for automated performance analysis of benchmarking data, Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy, Optimal exact designs of experiments via mixed integer nonlinear programming, Challenges in Enterprise Wide Optimization for the Process Industries, Deterministic global optimization with Gaussian processes embedded, Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit, Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities, Optimal designs for dose-escalation trials and individual allocations in cohorts, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Solving certain complementarity problems in power markets via convex programming, New SOCP relaxation and branching rule for bipartite bilinear programs, Global optimality bounds for the placement of control valves in water supply networks, Validated constraints solving --- practicalities, pitfalls, and new developments, Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization, Alternative regularizations for outer-approximation algorithms for convex MINLP, Nonlinear convex and concave relaxations for the solutions of parametric ODEs, Collusive game solutions via optimization, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, A derivative-free algorithm for constrained global optimization based on exact penalty functions, Global optimization of nonconvex problems with multilinear intermediates
Uses Software
