Skip to content

Optimization Online

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

A Complexity Analysis Framework for Active Manifold Identification with Applications to $L_0$ and $L_p$ Regularization Models

Published: 2025/10/17, Updated: 2025/10/20
  • Tao Min
  • Categories Nonlinear Optimization, Nonsmooth Optimization, Optimization in Data Science Tags Accelerated projection gradient method, active set, alternating direction method of multipliers, nonsmooth analysis, partly smooth, Projection gradient method Short URL: https://optimization-online.org/?p=32246

    Article

    Download

    View PDF

    Post navigation
    Effective Solution Algorithms for Bulk-Robust Optimization Problems
    An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity convergence rate 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.