A proof of convergence of the concave-convex procedure using Zangwill's theory
type: Item
instance of: scholarly article
zbMATH Open document ID: 1254.90180
author: Gert R. G. Lanckriet
author: Bharath K. Sriperumbudur
published in: Neural Computation
publication date: 2012-10-02T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6089753
zbMATH Keywords: d.c. programs
zbMATH Keywords: convergence
zbMATH Keywords: local minimum
zbMATH Keywords: stationary point
describes a project that uses: PLCP
describes a project that uses: SQPlab
MaRDI profile type: Publication
Wikidata QID: Q45960843
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: DC programming: overview.
cites work: Sufficient conditions for the convergence of monotonic mathematical programming algorithms
cites work: Q3738922
cites work: Combined SVM-based feature selection and classification
cites work: Q5652137
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Multiplicative Updates for Nonnegative Quadratic Programming
cites work: On the convergence properties of the EM algorithm
cites work: The Concave-Convex Procedure
cites work: Q5591247
full work available at URL: neco a 00283
OpenAlex ID: W1997413930
DOI: 10.1162/NECO_A_00283
title: A proof of convergence of the concave-convex procedure using Zangwill's theory
description: scientific article; zbMATH DE number 6089753