Mathematical Programming Computational for Solving NP-Hardness Problem
Open Access
- 1 March 2021
- conference paper
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012137
Abstract
In this paper we will introduce a new approach for solving K-cluster problem which is one of the NP-hardness problem, in combinatorial optimization problems. In addition, P is NP-hardness if and only if the polynomial time of each NP problem is reduced to P. Actually, our study was focused on the two methods which is Penalty and Augmented Lagrangian methods base on the numerical result. Moreover, we tested the K-cluster problem and found the Augmented Lagrangian Method faster than Penalty method. Finally, our research is not just focus on the numerical computational but also improving the theoretical converges properties.Keywords
This publication has 9 references indexed in Scilit:
- An Inertial Algorithm for DC ProgrammingSet-Valued and Variational Analysis, 2018
- An Augmented Lagrangian Method for Optimization Problems in Banach SpacesSIAM Journal on Control and Optimization, 2018
- Rate of Convergence of the Bundle MethodJournal of Optimization Theory and Applications, 2017
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic ProgramsSIAM Journal on Optimization, 2002
- Bundle Trust-Region Algorithm for Bilinear Bilevel ProgrammingJournal of Optimization Theory and Applications, 2001
- Approximation Algorithms for NP-Hard ProblemsACM SIGACT News, 1997
- Proximity control in bundle methods for convex nondifferentiable minimizationMathematical Programming, 1990
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969
- Necessary and Sufficient Conditions for Inequality Constrained Extreme ValuesIndustrial & Engineering Chemistry Fundamentals, 1966