Skip to content

Optimization Online

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

Dimensionality Reduction for Classification: Comparison of Techniques and Dimension Choice

Published: 2008/04/23, Updated: 2009/07/02
  • Emilio Carrizosa
  • Steven De Bruyne
  • Frank Plastria
    • Categories Data-Mining

    Citation

    This paper is published in Lecture Notes in Artificial Intelligence 5139, p411-418, Springer

    Post navigation
    General algorithmic frameworks for online problems
    On sublattice determinants in reduced bases
    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

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