A subgradient projection method for quasiconvex minimization

DOI10.1007/S11117-024-01082-ZMaRDI QIDQ6624922zbMATH OpenFDO

Authors Juan Choque, Felipe Lara, Raul T. Marcavillaca

Publication date 28 October 2024

Published in Positivity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11117-024-01082-Z

zbMATH Keywords

first-order methodsgeneralized convexitynonconvex optimizationquasiconvexitysubgradient methods

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Convergence and efficiency of subgradient methods for quasiconvex minimization
• Application of the method of conjugate subgradients to minimization of quasiconvex functions
• scientific article; zbMATH DE number 5538161
• Subgradient projection algorithm. II
• A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems

Cites work

• A note on strongly convex and quasiconvex functions
• A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
• Abstract convergence theorem for quasi-convex optimization problems with applications
• Algorithms for quasiconvex minimization
• Convergence and efficiency of subgradient methods for quasiconvex minimization
• Convergence rates of subgradient methods for quasi-convex optimization problems
• Convex analysis and monotone operator theory in Hilbert spaces
• First-order methods in optimization
• Full convergence of the steepest descent method with inexact line searches
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• scientific article; zbMATH DE number 3272538 (Why is no real title available?)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
• Inexact subgradient methods for quasi-convex optimization problems
• Lower subdifferentiable functions and their minimization by cutting planes
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• On Convergence Properties of a Subgradient Method
• On strong quasiconvex functions and boundedness of level sets
• On strongly quasiconvex functions: existence results and proximal point algorithms
• Quasi-Fejérian analysis of some optimization algorithms
• Strong subdifferentials: theory and applications in nonconvex optimization

Cited in

(3)

• Adaptive subgradient methods for mathematical programming problems with quasiconvex functions
• Strongly quasiconvex functions: what we know (so far)
• On optimality conditions for mathematical programming problems based on strong subdifferentials

This page was built for publication: A subgradient projection method for quasiconvex minimization

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