Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computational Optimization and Applications

A robust Lagrangian-DNN method for a class of quadratic optimization problems

Naohiko Arima, Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh

Published Oct 3, 2016• 11 citations
Publisher
DOI
10.1007/s10589-016-9879-0

Related papers

An effective approach for DNN relaxation problems for mixed binary nonconvex quadratic optimization,

未来 田中, Mirai Tanaka, 和秀 中田 +3 more

•Feb 1, 2012•0 citations

An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions

Xuewen Mu, Wenlong Liu

Optimization Letters•Mar 18, 2015•1 citation

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Geraldo Regis Mauri, Luiz Antônio Nogueira Lorena

Computers & Operations Research•Sep 13, 2011•14 citations

A new polynomially solvable class of quadratic optimization problems with box constraints

Milan Hladík, Michal Černý, Miroslav Rada

arXiv:1911.10877•Optimization Letters•Feb 19, 2021•7 citations

Parametric Lagrangian dual for the binary quadratic programming problem

Yong Xia, Wenxun Xing

Journal of Global Optimization•Feb 26, 2014•4 citations

A polynomial case of unconstrained zero-one quadratic optimization

Kim Allemand, Komei Fukuda, Thomas M. Liebling +1 more

Mathematical Programming•Oct 1, 2001•75 citations