Skip to content

Optimization Online

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

constraint selection

Tractable continuous approximations for constraint selection via cardinality minimization

Published: 2022/10/18
  • Miju Ahn
  • Harsha Gangammanavar
  • David Troxell
  • Categories Nonlinear Optimization Tags approximation methods, cardinality minimization problem, constraint selection, difference of convex programming, intensity-modulated radiation therapy (IMRT)

    Article Download View Tractable continuous approximations for constraint selection via cardinality minimization

    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 compressed sensing 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 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

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