Pages that link to "Item:Q4720300"

The following pages link to An introduction to the theory of nonsmooth optimization (Q4720300):

Displaying 15 items.

• Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
• Robustness in nonsmooth nonconvex optimization problems (Q830202) (← links)
• Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
• Optimization with nonsmooth data (Q1097840) (← links)
• Characterizing optimality in mathematical programming models (Q1108200) (← links)
• The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
• Optimality conditions for convex problems on intersections of non necessarily convex sets (Q2173517) (← links)
• Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
• On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
• Error bounds for inequality systems defining convex sets (Q2230941) (← links)
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints (Q2355322) (← links)
• On multiobjective bilevel optimization using tangential subdifferentials (Q2691426) (← links)
• A mean value theorem for tangentially convex functions (Q2699635) (← links)
• <i>ϵ</i>-Efficient solutions in semi-infinite multiobjective optimization (Q4634336) (← links)
• Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)