AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

An Exact Penalty Method for Binary Optimization Based on MPEC Formulation

Ganzhao Yuan, Bernard Ghanem

AAAI 2017 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 52 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use MPEC exact penalty (MPEC-EPM) instead of LP relaxationdense subgraph discovery · 8 web graphssubgraph densityImproved
use MPEC-EPM instead of L2-box ADMMdense subgraph discovery · dblp-2010, in-2004, amazon-2008, dblp-2011subgraph densityImproved
use MPEC-EPM instead of LP relaxationdense subgraph discovery · in-2004CPU time (s): 79 -> 1023Hurt
use MPEC-EPM instead of L2-box ADMMdense subgraph discovery · enronCPU time (s): 40 -> 29Improved
use MPEC-EPM instead of L2-box ADMMdense subgraph discovery · dblp-2010CPU time (s): 234 -> 282Hurt
use Feige and Ravi greedy methods instead of MPEC-EPMdense subgraph discovery · 8 web graphssubgraph densityHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy