The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase separable optimization (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1989-2011 (8)
Publication types (Num. hits)
article(6) incollection(1) inproceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 10 keywords

Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sangwoon Yun, Paul Tseng, Kim-Chuan Toh A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Chengxian Xu Generalized Total Least Squares. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Generalized nonlinear least squares, Separable optimization, separated Newton method, Gauss-Newton method
1Ladislav Luksan, Ctirad Matonoha, Jan Vlcek Algorithm 896: LSA: Algorithms for large-scale optimization. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF discrete Newton methods, large-scale nonlinear least squares, large-scale nonlinear minimax, large-scale nonsmooth optimization, large-scale systems of nonlinear equations, limited-memory methods, partially separable problems, primal interior-point methods, sparse problems, quasi-Newton methods, Large-scale optimization
1Elmor L. Peterson The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality. Search on Bibsonomy Annals OR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF ordinary programming, post-optimality analysis, conjugate transformation, Legendre transformation, dual cones, orthogonal complementary subspaces, recession directions, separable optimization, sub-optimization, optimization, convex optimization, Lagrange multipliers, geometric programming, orthogonal projection, duality theory, parametric programming
1Shin-Yeu Lin Complete decomposition algorithm for nonconvex separable optimization problems and applications. Search on Bibsonomy Automatica The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Dorit S. Hochbaum, J. George Shanthikumar Convex Separable Optimization Is Not Much Harder than Linear Optimization Search on Bibsonomy J. ACM The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Piotr Tatjewski New dual-type decomposition algorithm for nonconvex separable optimization problems. Search on Bibsonomy Automatica The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Dorit S. Hochbaum, J. George Shanthikumar The Complexity of Nonlinear Separable Optimization. Search on Bibsonomy ICALP The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.