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

DOI10.1134/S0001434622010059MaRDI QIDQ2113393zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3120542 (Why is no real title available?)
• scientific article; zbMATH DE number 3155046 (Why is no real title available?)
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 3805870 (Why is no real title available?)
• scientific article; zbMATH DE number 823375 (Why is no real title available?)
• scientific article; zbMATH DE number 3892037 (Why is no real title available?)
• scientific article; zbMATH DE number 6731404 (Why is no real title available?)
• scientific article; zbMATH DE number 3272538 (Why is no real title available?)
• A note on strongly convex and quasiconvex functions
• Characterization of solutions of strong-weak convex programming problems
• Characterizations of prox-regular sets in uniformly convex Banach spaces
• Curvature Measures
• Elements of convex and strongly convex analysis
• Error bounds, quadratic growth, and linear convergence of proximal methods
• Gradient projection and conditional gradient methods for constrained nonconvex minimization
• Local differentiability of distance functions
• Optimization and nonsmooth analysis
• Prox-regular functions in variational analysis
• Prox-regular sets and epigraphs in uniformly convex Banach spaces: various regularities and other properties
• Relaxation methods for minimization of pseudoconvex functions
• Stochastic Methods for Composite and Weakly Convex Optimization Problems
• Strong and Weak Convexity of Sets and Functions
• Subgradient methods for sharp weakly convex functions
• Sufficient global optimality conditions for weakly convex minimization problems

Cited in

(4)

• Sufficient global optimality conditions for weakly convex minimization problems
• Characterization of solutions of strong-weak convex programming 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)