An optimality condition for a nondifferentiable convex program
DOI10.1002/NAV.3800300306zbMATH Open0535.90072OpenAlexW1983736233MaRDI QIDQ3320133FDOQ3320133
Authors: Henry Wolkowicz 
Publication date: 1983
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800300306
Recommendations
- Optimality conditions for nonsmooth convex programming problems
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- scientific article; zbMATH DE number 4072728
- scientific article; zbMATH DE number 4051368
- scientific article; zbMATH DE number 24411
- Sufficient optimality conditions in nondifferentiable optimization∗
- scientific article; zbMATH DE number 169212
- A sufficient and necessary condition for nonconvex constrained optimization
- scientific article
- Optimality conditions for a nonconvex set-valued optimization problem
directional derivativesconesubdifferentialKarush-Kuhn-Tucker conditionsbinding constraintsNecessary optimality conditionsnondifferentiable convex program
Convex programming (90C25) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
Cited In (22)
- An existence theorem for a nonlinear nondifferentiable programming problem
- Title not available (Why is that?)
- Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions
- Higher-Order Duality in Nondifferentiable Multiobjective Programming
- Convex composite non-Lipschitz programming
- Title not available (Why is that?)
- A necessary optimality condition for nondifferentiable constrained extremum problems
- Optimality conditions for a class of nondifferentiable minmax programming problems
- Generalized convexity in nondifferentiable programming
- Title not available (Why is that?)
- Characterizing the contingent cone's convex kernel
- Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions
- Necessary and sufficient conditions for regularity of constraints in convex programming
- Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
- Second-Order Duality for Nondifferentiable Multiobjective Programming Problems
- Title not available (Why is that?)
- Duality and existence theory for nondifferentiable programming
- Properties of regular mathematical programming problems
- Duality for a non-differentiable programming problem
- Duality for a Class of Nondifferentiable Multiple Objective Programming Problems
- Title not available (Why is that?)
- Generalized concavity and duality with a square root term
This page was built for publication: An optimality condition for a nondifferentiable convex program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320133)
