Skip to content

Optimization Online

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

The Maximum Singularity Degree for Linear and Semidefinite Programming

Published: 2024/02/18, Updated: 2025/07/20
  • Hao Hu
Categories Convex Optimization, Semi-definite Programming Short URL: https://optimization-online.org/?p=25672

Article

Download

View PDF

Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization
On Coupling Constraints in Linear Bilevel 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 constrained 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

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