Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540156420, 9783540395096

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bundle methods

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074507 ◽

1985 ◽

pp. 299-344 ◽

Cited By ~ 3

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Bundle Methods

Methods with subgradient locality measures for minimizing nonconvex functions

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074503 ◽

1985 ◽

pp. 87-138

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Nonconvex Functions

Methods with subgradient deletion rules for unconstrained nonconvex minimization

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074504 ◽

1985 ◽

pp. 139-189

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Nonconvex Minimization

Numerical examples

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074508 ◽

1985 ◽

pp. 345-353

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Numerical Examples

Fundamentals

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074501 ◽

1985 ◽

pp. 1-43 ◽

Cited By ~ 2

Author(s):

Krzysztof C. Kiwiel

Feasible point methods for convex constrained minimization problems

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074505 ◽

1985 ◽

pp. 190-228

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Constrained Minimization ◽

Feasible Point ◽

Minimization Problems ◽

Constrained Minimization Problems

Aggregate subgradient methods for unconstrained convex minimization

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074502 ◽

1985 ◽

pp. 44-86

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Convex Minimization ◽

Subgradient Methods ◽

Unconstrained Convex Minimization

Methods of feasible directions for nonconvex constrained problems

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics ◽

10.1007/bfb0074506 ◽

1985 ◽

pp. 229-298

Author(s):

Krzysztof C. Kiwiel

Keyword(s):

Feasible Directions ◽

Constrained Problems ◽

Methods Of Feasible Directions

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in MathematicsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Bundle methods

Methods with subgradient locality measures for minimizing nonconvex functions

Methods with subgradient deletion rules for unconstrained nonconvex minimization

Numerical examples

Fundamentals

Feasible point methods for convex constrained minimization problems

Aggregate subgradient methods for unconstrained convex minimization

Methods of feasible directions for nonconvex constrained problems

Methods of Descent for Nondifferentiable Optimization - Lecture Notes in Mathematics
Latest Publications