Generalized convexity in nondifferentiable programming
From MaRDI portal
Publication:3338844
DOI10.1017/S0004972700001908zbMath0547.49015MaRDI QIDQ3338844
Publication date: 1984
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Axiomatic and generalized convexity (52A01) Programming in abstract spaces (90C48) Methods involving semicontinuity and convergence; relaxation (49J45) Optimality conditions for problems in abstract spaces (49K27)
Related Items
Optimality conditions for maximizing a locally Lipschitz function ⋮ A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential ⋮ On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives ⋮ A note on characterization of solution sets to pseudolinear programming problems ⋮ What is quasiconvex analysis?
Cites Work
- Unnamed Item
- Generalized gradients of Lipschitz functionals
- Characterization of optimality in convex programming without a constraint qualification
- Differential calculus in topological linear spaces
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- On minimization subject to cone constraints
- Stabilization and determination of the set of minimal binding constraints in convex programming1
- Generic Differentiability of Lipschitzian Functions
- Complete characterization of optimality for convex programming in banach spaces†
- On an abstract control problem
- A generalized Farkas lemma with applications to quasidifferentiable programming
- Characterizations of optimality without constraint qualification for the abstract convex program
- Fractional programming without differentiability
- On optimality conditions in nondifferentiable programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- A New Approach to Lagrange Multipliers
- Programming Problems with Convex Fractional Functions
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space