STUDY OF UNDERCOVER: A PRIMAL HEURISTIC FOR NON-CONVEX MIXED INTEGER QUADRATICALLY CONSTRAINED PROGRAMS
Bachelor's
Saved in:
Main Author: | LIM NI JUN |
---|---|
Other Authors: | MATHEMATICS |
Published: |
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/203971 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
An inexact primal-dual path following algorithm for convex quadratic SDP
by: Toh, K.-C.
Published: (2014) -
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
by: Sun, J., et al.
Published: (2013) -
A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
by: Huang, Z.-H., et al.
Published: (2014) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014) -
Singapore Undercovered
by: Lim, Amanda Xinyi, et al.
Published: (2018)