Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
From MaRDI portal
(Redirected from Publication:5158760)
Abstract: Conditional gradient methods have attracted much attention in both machine learning and optimization communities recently. These simple methods can guarantee the generation of sparse solutions. In addition, without the computation of full gradients, they can handle huge-scale problems sometimes even with an exponentially increasing number of decision variables. This paper aims to significantly expand the application areas of these methods by presenting new conditional gradient methods for solving convex optimization problems with general affine and nonlinear constraints. More specifically, we first present a new constraint extrapolated condition gradient (CoexCG) method that can achieve an iteration complexity for both smooth and structured nonsmooth function constrained convex optimization. We further develop novel variants of CoexCG, namely constraint extrapolated and dual regularized conditional gradient (CoexDurCG) methods, that can achieve similar iteration complexity to CoexCG but allow adaptive selection for algorithmic parameters. We illustrate the effectiveness of these methods for solving an important class of radiation therapy treatment planning problems arising from healthcare industry. To the best of our knowledge, all the algorithmic schemes and their complexity results are new in the area of projection-free methods.
Recommendations
- An extension of the conditional gradient method to a class of nonconvex optimization problems
- scientific article; zbMATH DE number 2210665
- Gradient projection and conditional gradient methods for constrained nonconvex minimization
- Publication:4887698
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Alternating conditional gradient method for convex feasibility problems
- Constrained gradient method for nonsmooth optimization problems
- Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- Conditional subgradient methods for constrained quasi-convex optimization problems
Cites work
- A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
- A Newton conditional gradient method for constrained nonlinear systems
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- An optimal method for stochastic composite optimization
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Conditional gradient sliding for convex optimization
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- First-order and stochastic optimization methods for machine learning
- scientific article; zbMATH DE number 7064051 (Why is no real title available?)
- Learning kernel-based halfspaces with the 0-1 loss
- New analysis and results for the Frank-Wolfe method
- On lower complexity bounds for large-scale smooth convex optimization
- Positive semidefinite metric learning using boosting-like algorithms
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Smooth minimization of non-smooth functions
- Sparse Approximate Solutions to Semidefinite Programs
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Cited in
(9)- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
- Alternating conditional gradient method for convex feasibility problems
- A stochastic primal-dual method for a class of nonconvex constrained optimization
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Conditional gradient sliding for convex optimization
- scientific article; zbMATH DE number 4057300 (Why is no real title available?)
- Nonsmooth projection-free optimization with functional constraints
- Adaptive generalized conditional gradient method for multiobjective optimization
- Splitting the conditional gradient algorithm
This page was built for publication: Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158760)
