Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set

DOI10.1134/S0001434622010059zbMATH Open1489.90114OpenAlexW4213455454MaRDI QIDQ2113393FDOQ2113393

Authors: S. I. Dudov, Mikhail Anatolievich Osiptsev 

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010059

Recommendations

• Characterization of solutions of strong-weak convex programming problems
• A necessary optimality condition for quasiconvex functions on closed convex sets
• On the maximization and minimization of a quasiconvex function
• Sufficient global optimality conditions for weakly convex minimization problems
• On the structure of the weakly efficient set for quasiconvex vector minimization

zbMATH Keywords

normal conesubdifferentialradius of neighborhood of local minimumstrongly and weakly convex sets and functionsstrongly quasiconvex functionsufficient conditions for minimum

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Curvature Measures
• Prox-regular sets and epigraphs in uniformly convex Banach spaces: various regularities and other properties
• Strong and Weak Convexity of Sets and Functions
• Characterizations of prox-regular sets in uniformly convex Banach spaces
• Optimization and nonsmooth analysis
• Local differentiability of distance functions
• Title not available (Why is that?)
• Prox-regular functions in variational analysis
• Elements of convex and strongly convex analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic Methods for Composite and Weakly Convex Optimization Problems
• Sufficient global optimality conditions for weakly convex minimization problems
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
• Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
• A note on strongly convex and quasiconvex functions
• Title not available (Why is that?)
• Relaxation methods for minimization of pseudoconvex functions
• Subgradient methods for sharp weakly convex functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of solutions of strong-weak convex programming problems

Cited In (3)

• Sufficient global optimality conditions for weakly convex minimization problems
• A necessary and sufficient condition for minimizing a convex Fréchet differentiable function on a certain hyperplane.
• A necessary optimality condition for quasiconvex functions on closed convex sets

This page was built for publication: Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113393)