Strong Rotundity and Optimization
From MaRDI portal
Recommendations
Cited in
(14)- On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
- Convergence of decreasing sequences of convex sets in nonreflexive Banach spaces
- Facial reduction in partially finite convex programming
- Strong convexity does not imply radial unboundedness
- Entropic projections and dominating points
- Maximum entropy and feasibility methods for convex and nonconvex inverse problems
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- Chance constrained optimization of elliptic PDE systems with a smoothing convex approximation
- Legendre-type integrands and convex integral functions
- Compactly locally uniformly convex functions
- Consistency of sample-based stationary points for infinite-dimensional stochastic optimization
- Proximal Galerkin: a structure-preserving finite element method for pointwise bound constraints
- Exact penalty results for mathematical programs with vanishing constraints
- Minimization of entropy functionals
This page was built for publication: Strong Rotundity and Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294749)