On Converse Duality for Nonsmooth Optimization Problem
From MaRDI portal
Publication:5286923
DOI10.1080/02522667.1993.10699145zbMATH Open0781.90082OpenAlexW2345651439MaRDI QIDQ5286923FDOQ5286923
Authors: Gue Myung Lee, Do Sang Kim
Publication date: 25 August 1993
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1993.10699145
Recommendations
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- scientific article; zbMATH DE number 1159218
- On Strict Converse Duality In Nonlinear Programming
- On duality for nonsmooth Lipschitz optimization problems
- Converse Duality in Nonlinear Programming
- Optimality and duality for a class of nonsmooth optimization problems
- Duality for nonconvex optimization and its applications
- Optimality and duality in nonsmooth conic vector optimization
- scientific article; zbMATH DE number 6117328
- Conjugate duality for generalized convex optimization problems
weak dualitygeneralized Kuhn-Tucker sufficient optimality criterianonsmooth invexity of Lipschitz functions
Cites Work
Cited In (8)
- Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems
- Title not available (Why is that?)
- Generalized Nonsmooth Invexity
- On duality for nonsmooth Lipschitz optimization problems
- On duality theorems for nonsmooth Lipschitz optimization problems
- Converse duality in nonlinear programming with cone constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On Converse Duality for Nonsmooth Optimization Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286923)