I'm a Ph.D. candidate in the department of Computer Sciences at the University of Wisconsin-Madision. I'm broadly interested in the area of linear/nonlinear optimization and complementarity problems with an emphasis on equilibrium programming and variational inequalities. My advisor is Prof. Michael Ferris.
I received my M.S. in Computer Science and Engineering and B.S. in Computer Science and Engineering and Mathematics, both at POSTECH.
I'm on the job market. Here is my CV.
Youngdae Kim, Olivier Huber, Michael C. Ferris: A structure-preserving pivotal method for affine variational inequalities. Mathematical Programming, Series B. (2017, online first)
Noam Goldberg, Youngdae Kim, Sven Leyffer, Thomas D. Veselka: Adaptively refined dynamic program for linear spline regression. Computational Optimization and Applications. 58(3): 523-541 (2014)
Youngdae Kim, Gae-won You, Seung-won Hwang: Ranking strategies and threats: a cost-based pareto optimization approach. Distributed and Parallel Databases. 26(1): 127-150 (2009)
Hwanjo Yu, Ilhwan Ko, Youngdae Kim, Seung-won Hwang, Wook-shin Han: Exact indexing for support vector machines. In Proc. of the ACM SIGMOD Conference on Data Management, June 12-16, 2011, Athens, Greece, pp. 709-720
Work in progress
Youngdae Kim, Michael C. Ferris: Solving equilibrium problems using extended mathematical programming. Draft is available upon request.
Youngdae Kim, Michael C. Ferris: Decomposition algorithms for equilibrium problems.
PATH VI is a Newton-based complementary pivotal method for variational inequalities. It can be used to solve equilibrium problems such as generalized Nash equilibrium problems (GNEP) and multiple optimization problems with equilibrium constraints (MOPEC) in one-shot.
PATH VI is integrated into GAMS (General Algebraic Modeling System) so that users do not have to create interfaces tailored to PATH VI.
It defines a new set of constructs that enable a natural translation of the algebraic formulation of equilibrium problems into modeling languages such as GAMS. It automatically reformulates the given equilibrium problem into a corresponding mixed complementarity problem (MCP). It also provides constructs to exploit the problem structure by the back-end solvers.
The new JAMS is available within GAMS.
Block LU update routine provides an efficient rank-1 update, especially for large-scale problems. It can be used with existing basis factorization routines such as LUSOL and UMFPACK, and shows significant performance improvement on large-scale equilibrium problems. It is being currently used as one of the linear algebra engines for PATH and PATH VI solvers.