Skip to content

Optimization Online

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

l_q minimization

New RIC Bounds via l_q-minimization with 0

Published: 2013/08/01
  • Lingchen Kong
  • Ziyan Luo
  • Naihua Xiu
  • Shenglong Zhou
  • Categories Combinatorial Optimization, Nonsmooth Optimization Tags bound, compressed sensing, exact recovery, l_q minimization, restricted isometry constant

    The restricted isometry constants (RICs) play an important role in exact recovery theory of sparse signals via l_q(0

    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.