Algorithms for parametric nonconvex programming

DOI10.1007/BF00935342zbMath0472.90051OpenAlexW2067221147MaRDI QIDQ1158344

Harold P. Benson

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

branch and bound algorithmcomputational experienceglobal minimizationparametric nonconvex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items

Application of Bayesian approach to numerical methods of global and stochastic optimization, An interval branch and bound algorithm for global optimization of a multiperiod pricing model, On the global solution of multi-parametric mixed integer linear programming problems, Algorithms for parametric nonconvex programming, A note on adapting methods for continuous global optimization to the discrete case, Global multi-parametric optimal value bounds and solution estimates for separable parametric programs

Cites Work

• Unnamed Item
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Algorithms for parametric nonconvex programming
• Global Minimization in Nonconvex All-Quadratic Programming
• An algorithm for nonconvex programming problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A Successive Underestimation Method for Concave Minimization Problems
• Optimal Facility Location with Concave Costs
• Branch-and-Bound Methods: A Survey
• An Algorithm for Separable Nonconvex Programming Problems
• Branch-and-Bound Methods: General Formulation and Properties
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• Binding Constraint Procedures of Quadratic Programming