A branch-and-bound algorithm for parametric mixed-binary nonlinear programs

DOI10.1007/S10898-024-01447-4MaRDI QIDQ7008134zbMATH OpenFDO

Authors Andrew C. Pangia, Margaret M. Wiecek

Publication date 24 March 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10898-024-01447-4

zbMATH Keywords

biconvex optimizationlinear interpolationmixed integerparametric optimizationsimplex approximationsubgradient ascent

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Mixed integer programming (90C11) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A branch and bound method for the solution of multiparametric mixed integer linear programming problems
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming
• A Multiresolution Approximation Method for Fast Explicit Model Predictive Control
• A novel approach for solving multi-parametric problems with nonlinear constraints
• A parametric branch and bound approach to suboptimal explicit hybrid MPC
• A primal dual modified subgradient algorithm with sharp Lagrangian
• Advancing parametric optimization. On multiparametric linear complementarity problems with parameters in general locations
• An algorithm for approximate multiparametric convex programming
• An algorithm for multiparametric mixed-integer linear programming problems
• An algorithm for the solution of multiparametric mixed integer linear programming problems
• An Automatic Method of Solving Discrete Programming Problems
• Applying Gröbner basis method to multiparametric polynomial nonlinear programming
• Explicit extragradient-like method with regularization for variational inequalities
• Inequalities for Stochastic Nonlinear Programming Problems
• Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
• Integer Programming
• Introduction to sensitivity and stability analysis in nonlinear programming
• Modified extragradient-like algorithms with new stepsizes for variational inequalities
• Multi-parametric optimization and control
• On Lagrangian duality for multiparametric programs
• On solving parametric multiobjective quadratic programs with parameters in general locations
• On the global solution of multi-parametric mixed integer linear programming problems
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Optimal estimates for the linear interpolation error on simplices
• Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
• Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
• Robust optimization
• Sensitivity and stability analysis for nonlinear programming
• Spectral Finite-Element Methods for Parametric Constrained Optimization Problems
• The exact solution of multiparametric quadratically constrained quadratic programming problems

This page was built for publication: A branch-and-bound algorithm for parametric mixed-binary nonlinear programs

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