Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
From MaRDI portal
Recommendations
- Nonsmooth semi-infinite programming problems with mixed constraints
- An unconstrained convex programming approach to convex semi-infinite programming
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- scientific article; zbMATH DE number 7716271
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- On constrained optimization problems with nonsmooth cost functionals
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
- Nonsmooth Optimum Problems with Constraints
Cited in
(35)- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Characterizing best approximation from a convex set without convex representation
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- New extremal principles with applications to stochastic and semi-infinite programming
- Optimality and duality in nonsmooth conic vector optimization
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale -theory
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
- scientific article; zbMATH DE number 1811716 (Why is no real title available?)
- Optimality conditions for special semidefinite bilevel optimization problems
- scientific article; zbMATH DE number 7352423 (Why is no real title available?)
- A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
- Bilevel optimization and variational analysis
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- On formulae for the Ioffe geometric subdifferential of a supremum function
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Full stability in finite-dimensional optimization
- Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms
- Variational analysis in normed spaces with applications to constrained optimization
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Estimates for coderivative of solution map in bilevel program
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Robust constrained best approximation in Banach spaces
- A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Robustness in nonsmooth nonconvex optimization problems
This page was built for publication: Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169703)
