An introduction to the theory of nonsmooth optimization

DOI10.1080/02331938608843204zbMath0613.49017OpenAlexW1972848751MaRDI QIDQ4720300

Claude Lemaréchal

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843204

zbMATH Keywords

convex functionClarke's generalized gradientlocally Lipschitzian functionsapproximate second-order directional derivative\(\epsilon \)-subdifferential

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Duality theory (optimization) (49N15) Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25)

Related Items (20)

Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ Robustness in nonsmooth nonconvex optimization problems ⋮ Optimization with nonsmooth data ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization ⋮ Characterizing optimality in mathematical programming models ⋮ An optimization approach to robust nonlinear control design ⋮ Optimality conditions for convex problems on intersections of non necessarily convex sets ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ On multiobjective bilevel optimization using tangential subdifferentials ⋮ A mean value theorem for tangentially convex functions ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ Error bounds for inequality systems defining convex sets ⋮ Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard ⋮ Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials ⋮ Optimality Conditions for Nonconvex Constrained Optimization Problems ⋮ Unnamed Item ⋮ Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on the construction of higher order algorithms in convex optimization
• Calcul sous-différentiel et optimisation
• A Short Proof of the Variational Principle for Approximate Solutions of a Minimization Problem
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• On optimality conditions in nondifferentiable programming
• Semismooth and Semiconvex Functions in Constrained Optimization
• A New Approach to Lagrange Multipliers
• On the differential properties of the support function of the∈-subdifferential of a convex function
• Refinements of necessary optimality conditions in nondifferentiable programming II
• The Theory of Max-Min, with Applications
• Convex Analysis
• Sufficient conditions for extremum, penalty functions and regularity

This page was built for publication: An introduction to the theory of nonsmooth optimization