Decomposed quasiconvex optimization with application to generalized cone problems
Open Access
- 6 December 2024
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 19 (2) , 267-284
Abstract
We propose a gradient-based method to solve quasiconvex optimization problems through decomposed optimization and prove local superlinear convergence under mild regularity assumptions at the optimal solution. A practical implementation further provides global convergence while maintaining the fast local convergence. In numerical examples from generalized cone programming, the proposed method reduced the number of iterations to 18 to 50% compared to bisection.Keywords
Funding Information
- Universität Stuttgart
This publication has 17 references indexed in Scilit:
- Lectures on Variational Analysis2021
- Set-valued Optimization2015
- Newton-Type Methods for Optimization and Variational Problems2014
- Generalized Convexity and Optimization2009
- Variational Analysis and Generalized Differentiation I2006
- Handbook of Generalized Convexity and Generalized Monotonicity2005
- Convergence and efficiency of subgradient methods for quasiconvex minimizationMathematical Programming, 2001
- Perturbation Analysis of Optimization Problems2000
- Are Generalized Derivatives Sseful for Generalized Convex Functions?1998
- Additively decomposed quasiconvex functionsMathematical Programming, 1982