Algorithms for parametric nonconvex programming
type: Item
instance of: scholarly article
title: Algorithms for parametric nonconvex programming
zbMATH Open document ID: 0472.90051
DOI: 10.1007/BF00935342
author: Harold P. Benson
published in: Journal of Optimization Theory and Applications
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3741147
zbMATH Keywords: parametric nonconvex programming
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: computational experience
zbMATH Keywords: global minimization
MaRDI profile type: Publication
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
cites work: Optimal Facility Location with Concave Costs
cites work: Global Minimization in Nonconvex All-Quadratic Programming
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: An algorithm for nonconvex programming problems
cites work: On the convergence of two branch-and-bound algorithms for nonconvex programming problems
cites work: Q4136936
cites work: Branch-and-Bound Methods: A Survey
cites work: Branch-and-Bound Methods: General Formulation and Properties
cites work: Binding Constraint Procedures of Quadratic Programming
cites work: A Successive Underestimation Method for Concave Minimization Problems
full work available at URL: https://doi.org/10.1007/bf00935342
OpenAlex ID: W2067221147
description: scientific article; zbMATH DE number 3741147