Quasiconvex first-order approximations and Kuhn-Tucker type optimality conditions

DOI10.1016/0377-2217(93)90112-ZzbMATH Open0779.49023OpenAlexW1974189852MaRDI QIDQ1804059FDOQ1804059

S. Komlósi

Publication date: 29 June 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90112-z

zbMATH Keywords

nondifferentiable optimizationgeneralized derivativesKuhn-Tucker type necessary optimality conditionsfirst order approximationsquasiconvex first order approximationquasisubdifferential

Mathematics Subject Classification ID

Nonsmooth analysis (49J52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
• Semidifferentiable functions and necessary optimality conditions
• About differentiability of order one of quasiconvex functions on \(R^ n\).
• Solvability results for sublinear functions and operators
• Dini derivatives in optimization — Part I
• Abstract cone approximations and generalized differentiability in nonsmooth optimization
• Title not available (Why is that?)
• On generalized upper quasidifferentiability
• On a possible generalization of pshemchhy's quasidifferentiability

Cited In (4)

• What is quasiconvex analysis?
• KKT transformation approach for multi-objective multi-level linear programming problems
• First-Order Methods for Nonconvex Quadratic Minimization
• Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems.

This page was built for publication: Quasiconvex first-order approximations and Kuhn-Tucker type optimality conditions

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