Log in to save to my catalogue

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear conve...

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear conve...

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2306807547

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

About this item

Full title

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

Journal title

Mathematical programming, 2019-11, Vol.178 (1-2), p.215-262

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

More information

Scope and Contents

Contents

The problem of optimizing a quadratic form over an orthogonality constraint (QP-OC for short) is one of the most fundamental matrix optimization problems and arises in many applications. In this paper, we characterize the growth behavior of the objective function around the critical points of the QP-OC problem and demonstrate how such characterizat...

Alternative Titles

Full title

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2306807547

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2306807547

Other Identifiers

ISSN

0025-5610

E-ISSN

1436-4646

DOI

10.1007/s10107-018-1285-1

How to access this item