Regularized optimization methods for convex MINLP problems

DOI10.1007/s11750-016-0413-4zbMath1358.90086OpenAlexW2293133283MaRDI QIDQ518454

Welington de Oliveira

Publication date: 28 March 2017

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11824/130

zbMATH Keywords

nonsmooth optimizationmixed-integer programmingcutting-plane method

Mathematics Subject Classification ID

Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Mixed volumes and related topics in convex geometry (52A39)

Related Items (9)

On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems ⋮ A simple version of bundle method with linear programming ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Using regularization and second order information in outer approximation for convex MINLP ⋮ Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization ⋮ Alternative regularizations for outer-approximation algorithms for convex MINLP ⋮ Outer approximation for mixed-integer nonlinear robust optimization

Uses Software

• Bonmin
• AlphaECP
• OPTI

Cites Work

• Unnamed Item
• Unnamed Item
• A doubly stabilized bundle method for nonsmooth convex optimization
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• Level bundle methods for constrained convex optimization with various oracles
• A characterization of the subdifferential of singular Gaussian distribution functions
• On interval-subgradient and no-good cuts
• Divide to conquer: decomposition methods for energy optimization
• An algorithmic framework for convex mixed integer nonlinear programs
• An inexact bundle variant suited to column generation
• On the choice of explicit stabilizing terms in column generation
• Supply chain design under uncertainty using sample average approximation and dual decomposition
• Solving mixed integer nonlinear programs by outer approximation
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• New variants of bundle methods
• A branch-and-cut method for 0-1 mixed convex programming
• On parallelizing dual decomposition in stochastic integer programming
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Generalized Benders decomposition
• The Cutting-Plane Method for Solving Convex Programs
• Nonlinear Integer Programming
• Lectures on Stochastic Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Mixed-integer nonlinear optimization
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• Probabilistic constrained optimization. Methodology and applications
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Benchmarking optimization software with performance profiles.

This page was built for publication: Regularized optimization methods for convex MINLP problems