The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm

DOI10.1007/BF02346164zbMath0621.90079MaRDI QIDQ1090621

Frank Plastria

Publication date: 1988

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

zbMATH Keywords

nonsmooth optimizationcomputational resultsdistance constraintscutting plane algorithmssequence of lower boundsboundedly lower subdifferentiable functionscontinuous location problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Inventory, storage, reservoirs (90B05)

Related Items (15)

Sets of efficient points in a normed space ⋮ Solving general continuous single facility location problems by cutting planes ⋮ Lower subdifferentiability in minimax fractional programming^* ⋮ Localization in multifacility location theory ⋮ Generalized fractional programming and cutting plane algorithms ⋮ Weak lower subdifferentials and applications ⋮ Dominating sets for convex functions with some applications ⋮ Fractional programming by lower subdifferentiability techniques ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ Lower subdifferentiability of quadratic functions ⋮ Cutting plane algorithms and approximate lower subdifferentiability ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ Efficiency in constrained continuous location ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Algorithms for the quasiconvex feasibility problem

Cites Work

• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• Localization in single facility location
• Solving general continuous single facility location problems by cutting planes
• Newton's method for convex programming and Tschebyscheff approximation
• The Cutting-Plane Method for Solving Convex Programs
• Computational aspects of cutting-plane algorithms for geometric programming problems
• The Supporting Hyperplane Method for Unimodal Programming
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets

This page was built for publication: The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm