Conditional gradient algorithms with open loop step size rules
From MaRDI portal
Publication:1244889
DOI10.1016/0022-247X(78)90137-3zbMath0374.49017WikidataQ56763539 ScholiaQ56763539MaRDI QIDQ1244889
Publication date: 1978
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
90C25: Convex programming
47H05: Monotone operators and generalizations
47J05: Equations involving nonlinear operators (general)
90C99: Mathematical programming
Related Items
Unnamed Item, Simplified versions of the conditional gradient method, Generalized Conditional Gradient for Sparse Estimation, Unnamed Item, Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization, Linear convergence of accelerated conditional gradient algorithms in spaces of measures, Bayesian Quadrature, Energy Minimization, and Space-Filling Design, The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems, New analysis and results for the Frank-Wolfe method, Solving variational inequalities with monotone operators on domains given by linear minimization oracles, New results on subgradient methods for strongly convex optimization problems with a unified analysis, Convergence and rate of convergence of some greedy algorithms in convex optimization, Dual subgradient algorithms for large-scale nonsmooth learning problems, Conditional gradient algorithms for norm-regularized smooth convex optimization, Primal and dual predicted decrease approximation methods, Solving variational inequality and fixed point problems by line searches and potential optimization, Robust budget allocation via continuous submodular functions, Adaptive conditional gradient method, Greedy approximation in convex optimization, Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators, Linearly convergent away-step conditional gradient for non-strongly convex functions, Low Complexity Regularization of Linear Inverse Problems, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple averaging process for approximating the solutions of certain optimal control problems
- Convexity, monotonicity, and gradient processes in Hilbert space
- Note on sequential estimation of second partial derivatives
- Minimization of functions having Lipschitz continuous first partial derivatives
- An algorithmic approach to nonlinear analysis and optimization
- On the classification of singular and nonsingular extremals for the Pontryagin maximum principle
- An iterative method of solving a game
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- A control averaging technique for solving a class of singular optimal control problems
- An Historical Survey of Computational Methods in Optimal Control
- The iterative solution of the equation $y \in x + Tx$ for a monotone operator $T$ in Hilbert space
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- A New Iterative Procedure for the Minimization of a Quadratic Form on a Convex Set
- On Steepest Descent
- A Geometrically Convergent Algorithm for Solving Optimal Control Problems
- Accelerated Frank–Wolfe Algorithms
- Mean Value Methods in Iteration
- A Stochastic Approximation Method
- Iterative construction of fixed points for multivalued operators of the monotone type
