Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
From MaRDI portal
Publication:2010105
Abstract: The sum of ratios problem has a variety of important applications in economics and management science, but it is difficult to globally solve this problem. In this paper, we consider the minimization problem of a sum of a number of nondifferentiable quasi-convex component functions over a closed and convex set, which includes the sum of ratios problem as a special case. The sum of quasi-convex component functions is not necessarily to be quasi-convex, and so, this study goes beyond quasi-convex optimization. Exploiting the structure of the sum-minimization problem, we propose a new incremental subgradient method for this problem and investigate its convergence properties to a global optimal solution when using the constant, diminishing or dynamic stepsize rules and under a homogeneous assumption and the H"{o}lder condition of order . To economize on the computation cost of subgradients of a large number of component functions, we further propose a randomized incremental subgradient method, in which only one component function is randomly selected to construct the subgradient direction at each iteration. The convergence properties are obtained in terms of function values and distances of iterates from the optimal solution set with probability 1. The proposed incremental subgradient methods are applied to solve the sum of ratios problem, as well as the multiple Cobb-Douglas productions efficiency problem, and the numerical results show that the proposed methods are efficient for solving the large sum of ratios problem.
Recommendations
- Inexact subgradient methods for quasi-convex optimization problems
- Stochastic subgradient method for quasi-convex optimization problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Convergence and efficiency of subgradient methods for quasiconvex minimization
Cites work
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 1328986 (Why is no real title available?)
- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A proximal stochastic gradient method with progressive variance reduction
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Adaptive subgradient methods for online learning and stochastic optimization
- Algorithms for the quasiconvex feasibility problem
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Conditional subgradient methods for constrained quasi-convex optimization problems
- Conditional subgradient optimization -- theory and applications
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convex optimization algorithms
- Fractional Programming with Homogeneous Functions
- Fractional programming: The sum-of-ratios case
- Generalized concavity
- Handbook of generalized convexity and generalized monotonicity
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Incremental proximal methods for large scale convex optimization
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Inexact subgradient methods for quasi-convex optimization problems
- Normal characterization of the main classes of quasiconvex functions
- Normalized Incremental Subgradient Algorithm and Its Application
- On Convergence Properties of a Subgradient Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- On properties of supporting and quasi-supporting vectors
- Primal-dual subgradient methods for convex problems
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Solving the sum-of-ratios problem by an interior-point method
- Stochastic subgradient method for quasi-convex optimization problems
- The effect of deterministic noise in subgradient methods
Cited in
(9)- The equivalence of three types of error bounds for weakly and approximately convex functions
- A subgradient projection method for quasiconvex minimization
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
This page was built for publication: Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010105)
