2019
DOI: 10.48550/arxiv.1909.01123
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Contraction methods for continuous optimization

Xiaopeng Luo,
Xin Xu

Abstract: We describe a class of algorithms that establishes a contracting sequence of closed sets for solving continuous optimization. From the perspective of ensuring effective contractions to achieve a certain accuracy, all the possible continuous optimization problems could be divided into three categories: logarithmic time contractile, polynomial time contractile, or noncontractile. For any problem from the first two categories, the constructed contracting sequence converges to the set of all global minimizers with… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 20 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?