Search Results - Nedich, Angelia

Refine Results
  1. 1
    A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints

    A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints by Tatarenko, Tatiana, Nedich, Angelia

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    A geometric framework for nonconvex optimization duality using augmented lagrangian functions

    A geometric framework for nonconvex optimization duality using augmented lagrangian functions by Nedich, Angelia, Ozdaglar, Asuman

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Random minibatch subgradient algorithms for convex problems with functional constraints

    Random minibatch subgradient algorithms for convex problems with functional constraints by Nedich, Angelia, Necoara, Ion

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    On existence of solutions to non-convex minimization problems

    On existence of solutions to non-convex minimization problems by Rele, Rohan, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Non-Monotone Variational Inequalities

    Non-Monotone Variational Inequalities by Arefizadeh, Sina, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Huber Loss-Based Penalty Approach to Problems with Linear Constraints

    Huber Loss-Based Penalty Approach to Problems with Linear Constraints by Nedich, Angelia, Tatarenko, Tatiana

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Accelerating Distributed Nash Equilibrium Seeking

    Accelerating Distributed Nash Equilibrium Seeking by Tatarenko, Tatiana, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Characterization of Potential Games: Application in Aggregative Games

    Characterization of Potential Games: Application in Aggregative Games by Arefizadeh, Sina, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Differentially-private Distributed Algorithms for Aggregative Games with Guaranteed Convergence

    Differentially-private Distributed Algorithms for Aggregative Games with Guaranteed Convergence by Wang, Yongqiang, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    On Characterizations of Potential and Ordinal Potential Games

    On Characterizations of Potential and Ordinal Potential Games by Arefizadeh, Sina, Nedich, Angelia, Dasarathy, Gautam

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Adaptive Methods for Variational Inequalities under Relaxed Smoothness Assumption

    Adaptive Methods for Variational Inequalities under Relaxed Smoothness Assumption by Vankov, Daniil, Nedich, Angelia, Sankar, Lalitha

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Last Iterate Convergence of Popov Method for Non-monotone Stochastic Variational Inequalities

    Last Iterate Convergence of Popov Method for Non-monotone Stochastic Variational Inequalities by Vankov, Daniil, Nedich, Angelia, Sankar, Lalitha

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints

    A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints by Tatarenko, Tatiana, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Convergence Rate of a Penalty Method for Strongly Convex Problems with Linear Constraints

    Convergence Rate of a Penalty Method for Strongly Convex Problems with Linear Constraints by Nedich, Angelia, Tatarenko, Tatiana

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Minibatch stochastic subgradient-based projection algorithms for solving convex inequalities

    Minibatch stochastic subgradient-based projection algorithms for solving convex inequalities by Necoara, Ion, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets

    Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets by Tatarenko, Tatiana, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Distributed Stochastic Optimization with Gradient Tracking over Time-Varying Directed Networks

    Distributed Stochastic Optimization with Gradient Tracking over Time-Varying Directed Networks by Duong Thuy Anh Nguyen, Duong Tung Nguyen, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Accelerated \(AB\)/Push-Pull Methods for Distributed Optimization over Time-Varying Directed Networks

    Accelerated \(AB\)/Push-Pull Methods for Distributed Optimization over Time-Varying Directed Networks by Duong Thuy Anh Nguyen, Duong Tung Nguyen, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Geometric Convergence of Distributed Heavy-Ball Nash Equilibrium Algorithm over Time-Varying Digraphs with Unconstrained Actions

    Geometric Convergence of Distributed Heavy-Ball Nash Equilibrium Algorithm over Time-Varying Digraphs with Unconstrained Actions by Duong Thuy Anh Nguyen, Duong Tung Nguyen, Nedich, Angelia

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Optimizing \((L_0, L_1)\)-Smooth Functions by Gradient Methods

    Optimizing \((L_0, L_1)\)-Smooth Functions by Gradient Methods by Vankov, Daniil, Rodomanov, Anton, Nedich, Angelia, Sankar, Lalitha, Stich, Sebastian U

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: