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

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear... Math. Program., Ser. A https://doi.org/10.1007/s10107-018-1285-1 FULL LENGTH PAPER Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods 1 1,2 Huikang Liu · Anthony Man-Cho So · Weijie Wu Received: 17 November 2017 / Accepted: 30 April 2018 © Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society 2018 Abstract 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 characterization can be used to obtain strong convergence rate results for iterative methods that exploit the manifold structure of the orthogonality constraint (i.e., the Stiefel manifold) to find a critical point of the problem. Specifically, our primary contribution is to show that the Łojasiewicz exponent at any critical point of the QP-OC problem is 1/2. Such a result is significant, as it expands the currently very limited repertoire of optimization problems for which the Łojasiewicz exponent is explicitly known. Moreover, it allows us to show, in http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematical Programming Springer Journals

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

Loading next page...
 
/lp/springer_journal/quadratic-optimization-with-orthogonality-constraint-explicit-w5cYpPVbCf
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society
Subject
Mathematics; Calculus of Variations and Optimal Control; Optimization; Mathematics of Computing; Numerical Analysis; Combinatorics; Theoretical, Mathematical and Computational Physics; Mathematical Methods in Physics
ISSN
0025-5610
eISSN
1436-4646
D.O.I.
10.1007/s10107-018-1285-1
Publisher site
See Article on Publisher Site

Abstract

Math. Program., Ser. A https://doi.org/10.1007/s10107-018-1285-1 FULL LENGTH PAPER Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods 1 1,2 Huikang Liu · Anthony Man-Cho So · Weijie Wu Received: 17 November 2017 / Accepted: 30 April 2018 © Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society 2018 Abstract 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 characterization can be used to obtain strong convergence rate results for iterative methods that exploit the manifold structure of the orthogonality constraint (i.e., the Stiefel manifold) to find a critical point of the problem. Specifically, our primary contribution is to show that the Łojasiewicz exponent at any critical point of the QP-OC problem is 1/2. Such a result is significant, as it expands the currently very limited repertoire of optimization problems for which the Łojasiewicz exponent is explicitly known. Moreover, it allows us to show, in

Journal

Mathematical ProgrammingSpringer Journals

Published: Jun 1, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off