An introduction to the theory of nonsmooth optimization
From MaRDI portal
\(\epsilon \)-subdifferentialapproximate second-order directional derivativeClarke's generalized gradientconvex functionlocally Lipschitzian functions
Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25) Fréchet and Gateaux differentiability in optimization (49J50) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15) Convex programming (90C25) Nonlinear programming (90C30)
Recommendations
- The rise of nonsmooth analysis: its main tools
- scientific article; zbMATH DE number 41617
- scientific article; zbMATH DE number 4056411
- Nonsmooth optimization
- scientific article; zbMATH DE number 194327
- Maximal monotone relations and the second derivatives of nonsmooth functions
- scientific article; zbMATH DE number 880244
- scientific article; zbMATH DE number 3889293
- scientific article; zbMATH DE number 3942323
- Monotone convex and first order maps in optimization of nonsmooth lipschitz functions∗
Cites work
- A New Approach to Lagrange Multipliers
- A Short Proof of the Variational Principle for Approximate Solutions of a Minimization Problem
- Calcul sous-différentiel et optimisation
- Convex Analysis
- scientific article; zbMATH DE number 3918320 (Why is no real title available?)
- scientific article; zbMATH DE number 3496814 (Why is no real title available?)
- scientific article; zbMATH DE number 3027842 (Why is no real title available?)
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- On optimality conditions in nondifferentiable programming
- On the differential properties of the support function of the∈-subdifferential of a convex function
- Refinements of necessary optimality conditions in nondifferentiable programming II
- Semismooth and Semiconvex Functions in Constrained Optimization
- Some remarks on the construction of higher order algorithms in convex optimization
- Sufficient conditions for extremum, penalty functions and regularity
- The Theory of Max-Min, with Applications
Cited in
(50)- Maximal monotone relations and the second derivatives of nonsmooth functions
- Optimization with nonsmooth data
- Characterizing optimality in mathematical programming models
- Slope intervals, generalized gradients, semigradients, slant derivatives, and csets
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- 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
- Error bounds for inequality systems defining convex sets
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- On multiobjective bilevel optimization using tangential subdifferentials
- A mean value theorem for tangentially convex functions
- Optimization of discontinuous functions: A generalized theory of differentiation
- scientific article; zbMATH DE number 3889293 (Why is no real title available?)
- scientific article; zbMATH DE number 3866048 (Why is no real title available?)
- Characterization of nonsmooth functions through their generalized gradients
- Nonsmooth optimization
- An Invitation to Tame Optimization
- scientific article; zbMATH DE number 3940091 (Why is no real title available?)
- scientific article; zbMATH DE number 3942323 (Why is no real title available?)
- scientific article; zbMATH DE number 3981877 (Why is no real title available?)
- scientific article; zbMATH DE number 4056411 (Why is no real title available?)
- scientific article; zbMATH DE number 4070648 (Why is no real title available?)
- scientific article; zbMATH DE number 47468 (Why is no real title available?)
- Semismooth and Semiconvex Functions in Constrained Optimization
- An optimization approach to robust nonlinear control design
- Point-Based Set-Valued Approximations, C -Differential Operators and Applications
- \(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
- scientific article; zbMATH DE number 857667 (Why is no real title available?)
- Nonsmooth constraint qualifications for nonconvex inequality systems
- KKT optimality conditions in non-smooth, non-convex optimization
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Concepts on generalized -subdifferentials for minimizing locally Lipschitz continuous functions
- Essentials of numerical nonsmooth optimization
- Characterizations of the solution set for tangentially convex optimization problems
- Applying tangential subdifferentials in bilevel optimization
- Optimality conditions for nondifferentiable interval-valued bilevel optimization problems via tangential subdifferentials
- Necessary and sufficient optimality conditions for nonsmooth nonconvex generalized Nash equilibrium problems
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- Local optimality conditions and local saddle point theorems for nonconvex robust programming
- On multiobjective semi-infinite programs with vanishing constraints and tangential subdifferentials
- Sufficiency and duality criteria in tangential subdifferential governed bilevel multi-objective extremization models
- Characterizations of solution sets of nonsmooth mathematical programming problems
- Optimality conditions for nonsmooth vector interval-valued bilevel optimization problems in terms of tangential subdifferentials
- Tangential subdifferential-based necessary conditions for multiobjective min-max optimization
- On tangentially convex marginal functions
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- Robustness in nonsmooth nonconvex optimization problems
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
This page was built for publication: An introduction to the theory of nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720300)
