Related Experiment Video
Updated: Apr 4, 2026

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation
Published on: January 18, 2022
GNCCP-Graduated NonConvexityand Concavity Procedure
Abstract:
In this paper we propose the graduated nonconvexity and concavity procedure (GNCCP) as a general optimization framework to approximately solve the combinatorial optimization problems defined on the set of partial permutation matrices. GNCCP comprises two sub-procedures, graduated nonconvexity which realizes a convex relaxation and graduated concavity which realizes a concave relaxation. It is proved that GNCCP realizes exactly a type of convex-concave relaxation procedure (CCRP), but with a much simpler formulation without needing convex or concave relaxation in an explicit way. Actually, GNCCP involves only the gradient of the objective function and is therefore very easy to use in practical applications. Two typical related NP-hard problems, partial graph matching and quadratic assignment problem (QAP), are employed to demonstrate its simplicity and state-of-the-art performance.
Related Concept Videos
Second Derivatives and the Shape of a Graph
Application of Nonlinear Inequalities
Hyperbolic and Inverse Hyperbolic Functions: Problem Solving
Second Derivative Test: Problem Solving
Implicit Differentiation: Problem Solving
Area Problem

