Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
From MaRDI portal
Publication:6107989
Recommendations
- Second order analysis for robust inclusion systems and applications
- Optimality of robust approximation solutions for uncertain convex optimization problems
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Characterizations of robust solution for convex optimization problems with data uncertainty
Cites work
- A new exact penalty method for semi-infinite programming problems
- A new smoothing Newton-type algorithm for semi-infinite programming
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- A smoothing Newton method for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A survey of nonlinear robust optimization
- An easy path to convex analysis and applications
- Augmented lagrangians in semi-infinite programming
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- Convergence properties of a class of exact penalty methods for semi-infinite optimization problems
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Convex optimization in normed spaces. Theory, methods and examples
- Differential sensitivity analysis of variational inequalities with locally Lipschitz continuous solution operators
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- First and second-order optimality conditions for nonsmooth vector optimization using set-valued directional derivatives
- Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Globally convergent methods for semi-infinite programming
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- On a Semismooth* Newton Method for Solving Generalized Equations
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- Parabolic regularity in geometric variational analysis
- Relaxed robust second-order-cone programming
- Robust optimization
- Second order analysis for robust inclusion systems and applications
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semismooth Newton methods for solving semi-infinite programming problems
- Theory and applications of robust optimization
- Twice epi-differentiability of extended-real-valued functions with applications in composite optimization
- Variational Analysis
- Variational analysis of composite models with applications to continuous optimization
This page was built for publication: Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6107989)