Characterization of solutions of strong-weak convex programming problems
From MaRDI portal
Publication:3382765
DOI10.1070/SM9431zbMath1479.90214OpenAlexW3154241090MaRDI QIDQ3382765
Publication date: 22 September 2021
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm9431
optimality conditionsnonconvex programmingconvex programmingstrongly and weakly convex sets and functions
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Distance between strongly and weakly convex sets ⋮ Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set
Cites Work
- Uniform estimation of a convex body by a fixed-radius ball
- Subgradient methods for sharp weakly convex functions
- On asphericity of convex bodies
- Sufficient global optimality conditions for weakly convex minimization problems
- Prox-regular sets and epigraphs in uniformly convex Banach spaces: Various regularities and other properties
- Strong and Weak Convexity of Sets and Functions
- Curvature Measures
- Systematization of problems on ball estimates of a convex compactum
- Optimization and nonsmooth analysis
- Local differentiability of distance functions
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Prox-regular functions in variational analysis
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
- Abstract convexity and global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterization of solutions of strong-weak convex programming problems
