Kwak, Byung Man Kwak, Joon Young 2024-01-19T15:30:38Z 2024-01-19T15:30:38Z 2021-09-02 2021-03 1738-494X https://pubs.kist.re.kr/handle/201004/117377 A general nonlinear complementarity problem (NCP) is formulated as a finite set optimization problem called binary NCP, where design variables are identified by n-bit binary numbers. The binary NCP corresponds to the problem of finding a vertex of an n-dimensional unit cube with zero cost value. Two geometrically intuitive algorithms based on the geometry of the unit cube and another algebraically intuitive one based on the distribution of negative variables are implemented. They are called VSA (vertex search algorithm), FSA (face search algorithm), and NSA (negative-entry search algorithm). FSA and NSA are robust as shown by test problems of small to medium size. FSA, which is like a coordinate search algorithm, is much superior to the other two. It is simple to program and most reliable not only for NCPs but also for a new category called joker search problems. English KOREAN SOC MECHANICAL ENGINEERS Binary NCP: a new approach for solving nonlinear complementarity problems Article 10.1007/s12206-021-0229-5 1 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY, v.35, no.3, pp.1161 - 1166 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY 35 3 1161 1166 scie scopus kci ART002690454 000622286900032 2-s2.0-85101598727 Engineering, Mechanical Engineering Article Binary NCP Face search algorithm Joker search problem Negative-entry search algorithm Nonlinear complementarity problems Vertex search algorithm