Lower subdifferentiable functions and their minimization by cutting planes

DOI10.1007/BF00938758zbMath0542.90083OpenAlexW1980908866MaRDI QIDQ795741

Frank Plastria

Publication date: 1985

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

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

zbMATH Keywords

quasiconvex functionsLipschitz functionscutting plane algorithmboundary lower subdifferentiable functionsconcave- convex composite functionslower subgradients

Mathematics Subject Classification ID

Nonlinear programming (90C30) Fréchet and Gateaux differentiability in optimization (49J50) Numerical methods based on nonlinear programming (49M37)

Related Items (50)

Duality for quasiconvex minimization over closed convex cones ⋮ Solving general continuous single facility location problems by cutting planes ⋮ Lower subdifferentiability in minimax fractional programming^* ⋮ The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm ⋮ Convergence of inexact quasisubgradient methods with extrapolation ⋮ A subgradient method for multiobjective optimization ⋮ Generalized fractional programming and cutting plane algorithms ⋮ Generalized convexity of functions and generalized monotonicity of set-valued maps ⋮ Multipliers and general Lagrangians ⋮ Weak lower subdifferentials and applications ⋮ Relaxation methods with step regulation for solving constrained optimization problems ⋮ Preference Robust Optimization for Choice Functions on the Space of CDFs ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Existence and uniqueness of maximal elements for preference relations: variational approach ⋮ Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ On the maximization of (not necessarily) convex functions on convex sets ⋮ Characterization of solution sets of quasiconvex programs ⋮ Lagrangian approach to quasiconvex programing ⋮ On properties of supporting and quasi-supporting vectors ⋮ Fractional programming by lower subdifferentiability techniques ⋮ Variational analysis for the consumer theory ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Quasiconvex duality theory by generalized conjugation methods ⋮ Lower subdifferentiability of quadratic functions ⋮ Level function method for quasiconvex programming. ⋮ Critical duality ⋮ Cutting plane algorithms and approximate lower subdifferentiability ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ Bounded lower subdifferentiability optimization techniques: applications ⋮ V -dualities and ⊥-dualities ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ What is quasiconvex analysis? ⋮ Variational subdifferential for quasiconvex functions ⋮ Fixed point quasiconvex subgradient method ⋮ Optimality conditions for quasiconvex programming in terms of quasiconjugate functions ⋮ A subgradient projection method for quasiconvex minimization ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ Algorithms for quasiconvex minimization ⋮ Strong subdifferentials: theory and applications in nonconvex optimization ⋮ General models in min-max continuous location: Theory and solution techniques ⋮ Algorithms for the quasiconvex feasibility problem ⋮ Projective dualities for quasiconvex problems ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ An extension of the proximal point algorithm beyond convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Newton's method for convex programming and Tschebyscheff approximation
• An algorithm for the minimax Weber problem
• An improved vertex enumeration algorithm
• An algorithm for solving linearly constrained minimax problems
• The Cutting-Plane Method for Solving Convex Programs
• Generalized Gradients and Applications
• The Supporting Hyperplane Method for Unimodal Programming
• Seven Kinds of Convexity
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets
• A Review of Quasi-Convex Functions
• Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
• r-convex functions

This page was built for publication: Lower subdifferentiable functions and their minimization by cutting planes