Extends Lagrangian methods and convergence analysis to mixed-integer nonlinear programs using a local optimality notion for polyhedral constraints.
An interior pro ximal gradient method for nonconvex optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
Extends Lagrangian methods and convergence analysis to mixed-integer nonlinear programs using a local optimality notion for polyhedral constraints.