The Concave-Convex Procedure

The concave-convex procedure (CCCP) is a way to construct discrete-time iterative dynamical systems that are guaranteed to decrease global optimization and energy functions monotonically. This procedure can be applied to almost any optimization problem, and many existing algorithms can be interprete...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Neural computation 2003-04, Vol.15 (4), p.915-936
Hauptverfasser:	Yuille, A. L., Rangarajan, Anand
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Artificial intelligence Calculus of variations and optimal control Computer science control theory systems Connectionism. Neural networks Convex and discrete geometry Energy Metabolism Exact sciences and technology Geometry Mathematical analysis Mathematical programming Mathematics Neural Networks (Computer) Operational research and scientific management Operational research. Management science Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!