Generalized Gradient Methods of Nondifferentiable Optimization Employing Space Dilatation Operations

N. Z. Shor
Additional contact information
N. Z. Shor: Academy of Sciences of the Ukrainian SSR, V. M. Glushkov, Institute of Cybernetics

A chapter in Mathematical Programming The State of the Art, 1983, pp 501-529 from Springer

Abstract: Abstract A broad spectrum of complex problems of mathematical programming can be rather easily reduced to problems of minimization of nondifferentiable functions without constraints or with simple constraints. Thus, when decomposition schemes are used to solve structured optimization problems of large dimension or with a large number of constraints, the coordination problems with respect to linking variables (or dual estimates of linking constraints) as a rule prove to be problems of nondifferentiable optimization. The use of exact nonsmooth penalty functions in problems of nonlinear programming, maximum functions to estimate discrepancies in constraints, piecewise smooth approximation of technical-economic characteristics in practical problems of optimal planning and design, minimax compromise functions in problems of multi-criterion optimization, all of these generate problems of nondifferentiable optimization. Therefore, the efficiency of procedures for the solution of various complex problems of mathematical programming greatly depends on the efficiency of the algorithms employed to minimize nondifferentiable functions.

Keywords: Convex Body; Minimum Point; Polynomial Algorithm; Nonsmooth Optimization; Ellipsoid Method (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-68874-4_19

Ordering information: This item can be ordered from
http://www.springer.com/9783642688744

DOI: 10.1007/978-3-642-68874-4_19

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().