Subgradient methods for saddle point problems of quasiconvex optimization

MaRDI QIDQ5144126zbMATH OpenFDO

Authors Yaohua Hu, Carisa Kwok Wai Yu, Xiao Qi Yang

Publication date 14 January 2021

Full work available at URL http://yokohamapublishers.jp/online-p/Pafa/vol2/pafav2n1p83.pdf

zbMATH Keywords

primal-dual approachquasiconvex optimizationsaddle point problemstochastic approximatesubgradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• Stochastic subgradient method for quasi-convex optimization problems
• Subgradient methods for saddle-point problems
• Convergence and efficiency of subgradient methods for quasiconvex minimization
• Conditional subgradient methods for constrained quasi-convex optimization problems
• Abstract convergence theorem for quasi-convex optimization problems with applications

Cited in

(6)

• Subgradient methods for saddle-point problems
• Stochastic subgradient method for quasi-convex optimization problems
• Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
• Abstract convergence theorem for quasi-convex optimization problems with applications
• Adaptive subgradient methods for mathematical programming problems with quasiconvex functions
• Convergence rates of subgradient methods for quasi-convex optimization problems

This page was built for publication: Subgradient methods for saddle point problems of quasiconvex optimization

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