Solving mixed integer nonlinear programs by outer approximation

From MaRDI portal

Publication:1337138

Jump to:navigation, search

DOI10.1007/BF01581153zbMath0833.90088OpenAlexW2057338659WikidataQ90665307 ScholiaQ90665307MaRDI QIDQ1337138

Sven Leyffer, Roger Fletcher

Publication date: 18 March 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581153

zbMATH Keywords

subdifferentials infeasibility outer approximation algorithm worst case performance convex composite functions

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

A branch and bound algorithm for bi-level discrete network design problem, Natural gas production network infrastructure development under uncertainty, Minotaur: a mixed-integer nonlinear optimization toolkit, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A disjunctive cut strengthening technique for convex MINLP, Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, An Algorithmic Framework for MINLP with Separable Non-Convexity, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, A global optimization problem in portfolio selection, Finding multiple solutions to general integer linear programs, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty, The supporting hyperplane optimization toolkit for convex MINLP, Interactive dynamic optimization server – connecting one modelling language with many solvers, On solving generalized convex MINLP problems using supporting hyperplane techniques, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, Sparse high-dimensional regression: exact scalable algorithms and phase transitions, A new local and global optimization method for mixed integer quadratic programming problems, An overview of MINLP algorithms and their implementation in Muriqui optimizer, A recipe for finding good solutions to MINLPs, Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster, A storm of feasibility pumps for nonconvex MINLP, Global optimization of disjunctive programs, Decomposition strategy for the stochastic pooling problem, A mean-risk mixed integer nonlinear program for transportation network protection, Two linear approximation algorithms for convex mixed integer nonlinear programming, A partial outer convexification approach to control transmission lines, An exact algorithm for a resource allocation problem in mobile wireless communications, Extended formulations in mixed integer conic quadratic programming, A decomposable resource allocation model with generalized overarching protections, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion, Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, Inexact solution of NLP subproblems in MINLP, Generating valid linear inequalities for nonlinear programs via sums of squares, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, Heuristics for convex mixed integer nonlinear programs, An outer-approximation approach for information-maximizing sensor selection, A trajectory-based method for mixed integer nonlinear programming problems, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, A penalty function-based greedy diffusion search algorithm for the optimization of constrained nonlinear dynamical processes with discrete-valued input, Stacking sequence and shape optimization of laminated composite plates via a level-set method, A review of deterministic optimization methods in engineering and management, Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems, Finding multiple optimal solutions of signomial discrete programming problems with free variables, An augmented Lagrangian filter method, Generalized Benders' decomposition for topology optimization problems, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, Numerical algorithm for a class of constrained optimal control problems of switched systems, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs, Truss topology optimization with discrete design variables by outer approximation, Optimization methods for mixed integer weakly concave programming problems, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, A trust region SQP algorithm for mixed-integer nonlinear programming, Capacitated disassembly scheduling under stochastic yield and demand, An algorithmic framework for convex mixed integer nonlinear programs, Profitability of online order fulfillment in multi-channel retailing, Mixed integer programming with a class of nonlinear convex constraints, Regularized optimization methods for convex MINLP problems, Outer approximation and submodular cuts for maximum capture facility location problems with random utilities, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, Decomposition-based inner- and outer-refinement algorithms for global optimization, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes, A proximal-point outer approximation algorithm, Mixed integer programming for a special logic constrained optimal control problem, Reformulations for utilizing separability when solving convex MINLP problems, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, On speed scaling via integer programming, Mathematical programming approaches for generating \(p\)-efficient points, Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach, Derivative-free robust optimization by outer approximations, An optimization method for solving mixed discrete-continuous programming problems, Outer approximation for global optimization of mixed-integer quadratic bilevel problems, A method for convex black-box integer global optimization, Partially distributed outer approximation, Using regularization and second order information in outer approximation for convex MINLP, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, An integrated multi-product, multi-buyer supply chain under penalty, green, and quality control polices and a vendor managed inventory with consignment stock agreement: the outer approximation with equality relaxation and augmented penalty algorithm, Sparse classification: a scalable discrete optimization perspective, Sparse hierarchical regression with polynomials, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints, Alternative regularizations for outer-approximation algorithms for convex MINLP, Outer approximation for mixed-integer nonlinear robust optimization, Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, Nonlinear chance-constrained problems with applications to hydro scheduling, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Using projected cutting planes in the extended cutting plane method, Stochastic Cutting Planes for Data-Driven Optimization, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, Extended Formulations in Mixed-Integer Convex Programming, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method, An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives, A Scalable Algorithm for Sparse Portfolio Selection, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Sparse convex optimization toolkit: a mixed-integer framework, Nonconvex sensitivity-based generalized Benders decomposition, A Gauss-Newton-based decomposition algorithm for nonlinear mixed-integer optimal control problems, A survey on mixed-integer programming techniques in bilevel optimization, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, An outer-approximation algorithm for maximum-entropy sampling, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, An outer-approximation algorithm for maximum-entropy sampling, An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty, Outer-approximation algorithms for nonsmooth convex MINLP problems, Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions, Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications, Preface, Improving the performance of DICOPT in convex MINLP problems using a feasibility pump, Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems, On the generalization of ECP and OA methods to nonsmooth convex MINLP problems, Conflict Analysis for MINLP

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1337138&oldid=13469107"