Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

On Hazan’s algorithm for symmetric programming problems

Published: 2013/01/30
  • Leonid Faybusovich
  • Categories Approximation Algorithms, Linear, Cone and Semidefinite Programming Tags euclidean jordan algebras, low-rank approximations to optimal solutions, symmetric programming Short URL: https://optimization-online.org/?p=12296

    We describe the generalization of Hazan’s algorithm for symmetric programming problems

    Citation

    Notre Dame Report, December, 2012

    Article

    Download

    View PDF

    Post navigation
    Variable Metric Forward-Backward algorithm for minimizing the sum of a differentiable function and a convex function
    Robust Optimization under Multi-band Uncertainty – Part I: Theory
    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers approximation algorithms augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity conic optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2025 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.