The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Feasible direction methods (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991 (1) 2003 (1) 2009 (3)
Publication types (Num. hits)
article(1) book(1) incollection(3)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 32 occurrences of 26 keywords

Results
Found 5 publication records. Showing 5 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Siriphong Lawphongpanich Frank-Wolfe Algorithm. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Away direction, Bisection search, Differentiable function, Direction finding problem, Feasible direction, Feasible direction methods, First order Taylor series expansion, Geometrically, Golden section method, Inexact line search line, Line search problem, Nonempty, Parallel tangents, PARTAN, Positive definite matrix, Pseudoconvex, Regularized direction finding problem, Regularized Frank-Wolfe decomposition, Simplicial decomposition, Stepsize, Strongly convex, Network, Heuristics, Linear program, Globally optimal, Convex hull, Nonlinear programming, Quadratic programming, Convexity, Bounded, Search algorithms, Matrix, Column generation, Polyhedron, Convergence rate, Convex function, Stopping criterion, Simplex algorithm, Extreme point, Dantzig-Wolfe decomposition
1Siriphong Lawphongpanich Convex-Simplex Algorithm. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Basic component, Convex-simplex algorithm, Feasible direction methods, First order Taylor series expansion, Generalized upper bounding structure, Golden section method, Improving feasible direction, Inexact line search technique, Karush-Kuhn-Tucker conditions, Linearly independent, Line search problem, Nonbasic component, Nonlinear network flow problems, Nonsingular, Pseudoconvex function, Reduced gradient algorithm, Second order approximation, Superbasic variables, Linear program, Nonlinear programming, Polyhedron, Simplex algorithm, Extreme point, Generalized networks
1Emilio Spedicato, Zun-Quan Xia, Liwei Zhang ABS Algorithms for Optimization. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF ABS methods, Feasible direction methods, KT equations, Optimization, Linear programming, Interior point methods, Linear equations, Quasi-Newton methods
1Emilio Spedicato, Elena Bodon, Antonino Del Popolo, Nezam Mahdavi-Amiri ABS methods and ABSPACK for linear systems and optimization: A review. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ABS methods, linear algebraic systems, feasible direction methods, ABSPACK, simplex method, Diophantine equations
1Ding-Zhu Du Convergence theory of feasible direction methods. Search on Bibsonomy 1991   RDF
Displaying result #1 - #5 of 5 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.