Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

Published: 01 January 2005 Publication History

Abstract

We propose a prox-type method with efficiency estimate $O(\epsilon^{-1})$ for approximating saddle points of convex-concave C$^{1,1}$ functions and solutions of variational inequalities with monotone Lipschitz continuous operators. Application examples include matrix games, eigenvalue minimization, and computing the Lovasz capacity number of a graph, and these are illustrated by numerical experiments with large-scale matrix games and Lovasz capacity problems.

Cited By

View all
  • (2024)A Primal-Dual Smoothing Framework for Max-Structured Non-Convex OptimizationMathematics of Operations Research10.1287/moor.2023.138749:3(1535-1565)Online publication date: 1-Aug-2024
  • (2024)Solving Optimization Problems with Blackwell ApproachabilityMathematics of Operations Research10.1287/moor.2023.137649:2(697-728)Online publication date: 1-May-2024
  • (2024)Reconfigurable Intelligent Surface-Assisted Secret Key Generation in Spatially Correlated ChannelsIEEE Transactions on Wireless Communications10.1109/TWC.2023.329607623:3(2153-2166)Online publication date: 1-Mar-2024
  • Show More Cited By

Index Terms

  1. Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image SIAM Journal on Optimization
        SIAM Journal on Optimization  Volume 15, Issue 1
        2005
        318 pages

        Publisher

        Society for Industrial and Applied Mathematics

        United States

        Publication History

        Published: 01 January 2005

        Author Tags

        1. ergodic convergence
        2. extragradient method
        3. prox-method
        4. saddle point problem
        5. variational inequality

        Qualifiers

        • Article

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 24 Sep 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)A Primal-Dual Smoothing Framework for Max-Structured Non-Convex OptimizationMathematics of Operations Research10.1287/moor.2023.138749:3(1535-1565)Online publication date: 1-Aug-2024
        • (2024)Solving Optimization Problems with Blackwell ApproachabilityMathematics of Operations Research10.1287/moor.2023.137649:2(697-728)Online publication date: 1-May-2024
        • (2024)Reconfigurable Intelligent Surface-Assisted Secret Key Generation in Spatially Correlated ChannelsIEEE Transactions on Wireless Communications10.1109/TWC.2023.329607623:3(2153-2166)Online publication date: 1-Mar-2024
        • (2024)Local AdaGrad-type algorithm for stochastic convex-concave optimizationMachine Language10.1007/s10994-022-06239-z113:4(1819-1838)Online publication date: 1-Apr-2024
        • (2024)Robust Bond Portfolio Construction via Convex–Concave Saddle Point OptimizationJournal of Optimization Theory and Applications10.1007/s10957-024-02436-z201:3(1089-1115)Online publication date: 1-Jun-2024
        • (2024)Extragradient-type methods with last-iterate convergence rates for co-hypomonotone inclusionsJournal of Global Optimization10.1007/s10898-023-01347-z89:1(197-221)Online publication date: 1-May-2024
        • (2024)Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalitiesJournal of Global Optimization10.1007/s10898-023-01346-089:1(143-170)Online publication date: 1-May-2024
        • (2024)Stochastic projective splittingComputational Optimization and Applications10.1007/s10589-023-00528-687:2(397-437)Online publication date: 1-Mar-2024
        • (2024)From Halpern’s fixed-point iterations to Nesterov’s accelerated interpretations for root-finding problemsComputational Optimization and Applications10.1007/s10589-023-00518-887:1(181-218)Online publication date: 1-Jan-2024
        • (2024)Strong Convergence of the Regularized Operator Extrapolation Algorithm For Variational InequalitiesCybernetics and Systems Analysis10.1007/s10559-024-00680-960:3(392-402)Online publication date: 1-May-2024
        • Show More Cited By

        View Options

        View options

        Get Access

        Login options

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media