Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets

Proceedings of the AAAI Conference on Artificial Intelligence
doi 10.1609/aaai.v33i01.33011576
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for the Advancement of Artificial Intelligence (AAAI)

Related search

Distributed Subgradient Algorithm for Multi-Agent Convex Optimization With Local Constraint Sets

Applied and Computational Mathematics
2016English

Technique for Video Compression by Projection Onto Convex Sets

1984English

Restoration of Error-Diffused Images Using Projection Onto Convex Sets

IEEE Transactions on Image Processing
Computer GraphicsComputer-Aided DesignSoftware
2001English

Restoration of Clipped Seismic Waveforms Using Projection Onto Convex Sets Method

Scientific Reports
Multidisciplinary
2016English

Strongly Exposed Points in Weakly Compact Convex Sets in Banach Spaces

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Non-Asymptotic Rates for Communication Efficient Distributed Zeroth Order Strongly Convex Optimization

2018English

Majorization Theorems for Strongly Convex Functions

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2019English

Separating Convex Sets.

English

Three Convex Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy