Characterization of local solutions for a class of nonconvex programs

DOI10.1007/BF00933745zbMath0281.90078OpenAlexW1974585987MaRDI QIDQ1843382

P. P. Bansal, Stephen E. Jacobsen

Publication date: 1975

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30)

Related Items

Construction of test problems for a class of reverse convex programs, On the global minimization of a convex function under general nonconvex constraints, Intersection Disjunctions for Reverse Convex Sets, Reverse convex problems: an approach based on optimality conditions, Linear programs with an additional reverse convex constraint, Reverse convex programming, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, On the use of cuts in reverse convex programs, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, The complexity results of the sparse optimization problems and reverse convex optimization problems, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Unnamed Item, A level set algorithm for a class of reverse convex programs, Computational experience using an edge search algorithm for linear reverse convex programs, An algorithm for optimizing network flow capacity under economies of scale, Convex programs with an additional reverse convex constraint

Cites Work

• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Generalized Benders decomposition
• The Validity of a Family of Optimization Methods
• An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
• Iterative Solution of Nonlinear Optimal Control Problems