Similar Search Results

A restricted dual peaceman-rachford splitting method for a strengthened DNN relaxation for QAP

Graham, Naomi; Hu, Hao; Im, Jiyoung; Li, Xinxin; … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 4, pp. 2125-2143

Persistent link: https://www.econbiz.de/10013362702

A recipe for semidefinite relaxation for (0,1)-quadratic programming : in memory of Svata Poljak

Poljak, Svatopluk - In: Journal of global optimization 7 (1995) 1, pp. 51-73

Persistent link: https://www.econbiz.de/10001183956

Revisiting degeneracy, strict feasibility, stability, in linear programming

Im, Haesol; Wolkowicz, Henry - In: European journal of operational research : EJOR 310 (2023) 2, pp. 495-510

Persistent link: https://www.econbiz.de/10014340197

A low-dimensional semidefinite relaxation for the quadratic assignment problem

Ding, Yichuan; Wolkowicz, Henry - In: Mathematics of operations research 34 (2009) 4, pp. 1008-1022

Persistent link: https://www.econbiz.de/10003919407

On equivalence of semidefinite relaxations for quadratic matrix programming

Ding, Yichuan; Ge, Dongdong; Wolkowicz, Henry - In: Mathematics of operations research 36 (2011) 1, pp. 88-104

Persistent link: https://www.econbiz.de/10009007263

Efficient use of semidefinite programming for selection of rotamers in protein conformations

Burkowski, Forbes; Cheung, Yuen-Lam; Wolkowicz, Henry - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 748-766

Persistent link: https://www.econbiz.de/10010477263

Parametric convex quadratic relaxation of the quadratic knapsack problem

Fampa, Marcia Helena Costa; Lubke, D.; Wang, F.; … - In: European journal of operational research : EJOR 281 (2020) 1, pp. 36-49

Persistent link: https://www.econbiz.de/10012153431

A semismooth newton-type method for the nearest doubly stochastic matrix problem

Hu, Hao; Li, Xinxin; Im, Haesol; Wolkowicz, Henry - In: Mathematics of operations research 49 (2024) 2, pp. 729-751

Persistent link: https://www.econbiz.de/10014564361

Handbook of Semidefinite Programming : Theory, Algorithms, and Applications

Wolkowicz, Henry - 2000

Semidefinite programming (SDP) is one of the most exciting and active research areas in optimization. It has and continues to attract researchers with very diverse backgrounds, including experts in convex programming, linear algebra, numerical optimization, combinatorial optimization, control...

Persistent link: https://www.econbiz.de/10013519031