Solving convex MINLP optimization problems using a sequential cutting plane algorithm

DOI10.1007/S10589-005-3076-XMaRDI QIDQ2506191zbMATH OpenOpenAlexFDO

Authors Claus Still, Tapio Westerlund

Publication date 28 September 2006

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-005-3076-x

zbMATH Keywords

convex programmingbranch and boundmixed integer nonlinear programmingcutting plane algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• Algorithm for solution of convex MINLP problems
• A sequential cutting plane algorithm for solving convex NLP problems
• Regularized optimization methods for convex MINLP problems
• Mixed integer nonlinear programming using interior-point methods
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming

Cites work

• scientific article; zbMATH DE number 976325 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• A sequential cutting plane algorithm for solving convex NLP problems
• A tree-search algorithm for mixed integer programming problems
• An Approach to the Optimal Positioning of a New Product
• An Automatic Method of Solving Discrete Programming Problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• BARON: A general purpose global optimization software package
• Benchmarking optimization software with performance profiles.
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Different transformations for solving non-convex trim-loss problems by MINLP
• Encyclopedia of optimization. In 6 vols.
• Experiments in mixed-integer linear programming
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• MINLPLib -- a collection of test models for mixed-integer nonlinear programming
• MIP: Theory and practice -- closing the gap
• Nonlinear programming without a penalty function.
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques

Cited in

(14)

• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• A flexible platform for mixed-integer non-linear programming problems
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems
• Inversion of convection-diffusion equation with discrete sources
• Concurrent processing of mixed-integer non-linear programming problems
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
• A linear programming-based optimization algorithm for solving nonlinear programming problems
• Algorithm for solution of convex MINLP problems
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Mixed integer nonlinear programming using interior-point methods
• Route optimization for multiple searchers
• Strengthening the sequential convex MINLP technique by perspective reformulations
• Regularized optimization methods for convex MINLP problems
• A sequential cutting plane algorithm for solving convex NLP problems

Describes a project that uses

Uses Software

• NEOS
• MacMINLP
• MINLPLib
• AlphaECP
• filterSQP
• BARON

This page was built for publication: Solving convex MINLP optimization problems using a sequential cutting plane algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506191)