Skip to content

Optimization Online

Welcome
Repository
Submit
About
Help
My Eprints
Search for:

Hao Hu

The Maximum Singularity Degree for Linear and Semidefinite Programming

Published: 2024/02/18

Categories Convex Optimization, Semi-definite Programming

ArticleDownload View PDF

Search

Repository

Author List

Months

Archives

Categories

Categories

Keywords

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

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