Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Numerical Analysis

arXiv:1212.6492 (cs)
[Submitted on 28 Dec 2012]

Title:Canonical Primal-Dual Method for Solving Non-convex Minimization Problems

Authors:Changzhi Wu, Chaojie Li, David Yang Gao
View PDF
Abstract:A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing with the existing results, the proposed algorithm can achieve better performance.
Comments: 21 pages, 6 figures and 4 tables
Subjects: Numerical Analysis (math.NA); Data Structures and Algorithms (cs.DS); Optimization and Control (math.OC)
Cite as: arXiv:1212.6492 [cs.NA]
  (or arXiv:1212.6492v1 [cs.NA] for this version)
  https://doi.org/10.48550/arXiv.1212.6492

Submission history

From: David Gao [view email]
[v1] Fri, 28 Dec 2012 09:30:57 UTC (88 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2012-12
Change to browse by:
cs
cs.DS
cs.NA
math
math.OC

References & Citations

DBLP - CS Bibliography

listing | bibtex
Changzhi Wu
Chaojie Li
David Yang Gao
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)