|
|
|
|
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 |
| 1 | Sangwoon Yun, Paul Tseng, Kim-Chuan Toh |
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection.  |
Math. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chengxian Xu |
Generalized Total Least Squares.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Generalized nonlinear least squares, Separable optimization, separated Newton method, Gauss-Newton method |
| 1 | Ladislav Luksan, Ctirad Matonoha, Jan Vlcek |
Algorithm 896: LSA: Algorithms for large-scale optimization.  |
ACM Trans. Math. Softw.  |
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 |
| 1 | Elmor L. Peterson |
The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality.  |
Annals OR  |
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 |
| 1 | Shin-Yeu Lin |
Complete decomposition algorithm for nonconvex separable optimization problems and applications.  |
Automatica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, J. George Shanthikumar |
Convex Separable Optimization Is Not Much Harder than Linear Optimization  |
J. ACM  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Tatjewski |
New dual-type decomposition algorithm for nonconvex separable optimization problems.  |
Automatica  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, J. George Shanthikumar |
The Complexity of Nonlinear Separable Optimization.  |
ICALP  |
1989 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|