Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study the convex problem of optimizing the sum of a smooth function and a compactly supported nonsmooth term with a specific separable form.  analyze the block version of the generalized conditional gradient method when the blocks are chosen in a cyclic order. A global sublinear rate of convergence is established for two different stepsize strategies commonly used in this class of methods. Numerical comparisons of the proposed method to both the classical conditional gradient algorithm and its random block version demonstrate the effectiveness of the cyclic block update rule.
['Amir Beck', 'Edouard Pauwels', 'Shoham Sabach']
I am writing a research paper on a idea The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
[{"from": "human", "value": "I am writing a research paper on a idea The Cyclic Block Conditional Gradient Method for Convex Optimization Problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study the convex problem of optimizing the sum of a smooth function and a compactly supported nonsmooth term with a specific separable form.  analyze the block version of the generalized conditional gradient method when the blocks are chosen in a cyclic order. A global sublinear rate of convergence is established for two different stepsize strategies commonly used in this class of methods. Numerical comparisons of the proposed method to both the classical conditional gradient algorithm and its random block version demonstrate the effectiveness of the cyclic block update rule."}]