Quasi-Multiplier Rules for Quasidifferentiable Extremum Problems
From MaRDI portal
Publication:4805776
DOI10.1080/0233193021000015613zbMath1145.90463MaRDI QIDQ4805776
Publication date: 8 May 2003
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0233193021000015613
90C46: Optimality conditions and duality in mathematical programming
49J52: Nonsmooth analysis
90C48: Programming in abstract spaces
Related Items
Positively homogeneous functions revisited, Optimality conditions in quasidifferentiable vector optimization, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), On optimality conditions and duality results in a class of nonconvex quasidifferentiable optimization problems, Nonsmooth Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidifferentiable functions and necessary optimality conditions
- Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
- Equilibrium theory in infinite dimensional spaces
- Generalized K-T conditions and penalty functions for quasidifferentiable programming
- Lagrange multipliers in incentive-constrained problems
- Demyanov difference of two sets and optimality conditions of Lagrange multiplier type for constrained quasidifferential optimization.
- Infinite dimensional analysis. A hitchhiker's guide
- On quasidifferentiable mappings
- Nonsmoothness and quasidifferentiability
- On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
- A constraint qualification in quasidifferentiable programming
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Seperability of Star-Shaped Sets and its Application to an Optimization Problem
- Variational Analysis
- On Optimality Conditions in Quasidifferentiable Optimization
- Nonlinear Lagrangian theory for nonconvex optimization.
- On global optimality conditions via separation functions
- Extended Lagrange and penalty functions in optimization
