Generalized convexity in nondifferentiable programming

DOI10.1017/S0004972700001908MaRDI QIDQ3338844zbMATH OpenFDO

Authors B. M. Glover

Publication date 1984

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972700001908

zbMATH Keywords

Kuhn-Tucker type optimality conditionsquasidifferentiable cone-constraints

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Optimality conditions for problems in abstract spaces (49K27) Axiomatic and generalized convexity (52A01) Programming in abstract spaces (90C48)

Recommendations

• scientific article; zbMATH DE number 1263981
• An optimality condition for a nondifferentiable convex program
• Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
• On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
• Constraint qualifications in a class of nondifferentiable mathematical programming problems

Cites work

• A generalized Farkas lemma with applications to quasidifferentiable programming
• A New Approach to Lagrange Multipliers
• Characterization of optimality in convex programming without a constraint qualification
• Characterizations of optimality without constraint qualification for the abstract convex program
• Complete characterization of optimality for convex programming in banach spaces^†
• Differential calculus in topological linear spaces
• Fractional programming without differentiability
• Generalized gradients of Lipschitz functionals
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Generic Differentiability of Lipschitzian Functions
• scientific article; zbMATH DE number 3848919 (Why is no real title available?)
• On an abstract control problem
• On minimization subject to cone constraints
• On optimality conditions in nondifferentiable programming
• Programming Problems with Convex Fractional Functions
• Semismooth and Semiconvex Functions in Constrained Optimization
• Stabilization and determination of the set of minimal binding constraints in convex programming¹
• Strictly quasi-convex (concave) functions and duality in mathematical programming

Cited in

(15)

• Generalized convex functions and generalized differentials
• scientific article; zbMATH DE number 3887448 (Why is no real title available?)
• scientific article; zbMATH DE number 3885664 (Why is no real title available?)
• scientific article; zbMATH DE number 5150866 (Why is no real title available?)
• A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
• On Quasidifferentiable Functions and Non-Differentiable Programming
• A note on characterization of solution sets to pseudolinear programming problems
• scientific article; zbMATH DE number 2107635 (Why is no real title available?)
• What is quasiconvex analysis?
• Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
• Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
• Generic nondegeneracy in convex optimization
• Optimality conditions for maximizing a locally Lipschitz function
• Generalized Convexity, Generalized Monotonicity and Nonsmooth Analysis
• Convexification of a noninferior frontier

This page was built for publication: Generalized convexity in nondifferentiable programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3338844)