F. Clarke, Optimization and nonsmooth analysis, Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley & Sons Inc., New York, 1983. A WileyInterscience Publication. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Inexact Trust-Region Feasible-Point Algorithm for.. - Hallabi, Tapia (1995) (Correct)
.... of LMTR subprob The locally Lipschitz composite function f = IlFlla is regular, i.e. at any z and in any direction w in IR x IR m, its generalized directional derivative, denoted by f(z; w) and its one sided direc tional derivative, denoted by f (z; w) exist and are equal (see Clarke [2]) They are respectively defined by (2.1) 2.2) f(z tw) f(z ) f(z; w) lira sup z z, t O t f (z; w) lira f(z tw) f(z) to t For more details concerning properties of the various derivatives of f IIFlla, we refer the reader to Clarke [2] In this research, we use both ....
....w) exist and are equal (see Clarke [2] They are respectively defined by (2.1) 2. 2) f(z tw) f(z ) f(z; w) lira sup z z, t O t f (z; w) lira f(z tw) f(z) to t For more details concerning properties of the various derivatives of f IIFlla, we refer the reader to Clarke [2]. In this research, we use both derivatives althought they are equal. To study the optimality conditions, working with the one sided directional derivative is sufficient. But to analyze the behavior of the algorithm near an iterate that is not a constrained stationary point of f, the generalized ....
F.H. Clarke, Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley and Sons Publications, 1983. 16
Coordination And Geometric Optimization Via Distributed.. - Cortes, Bullo (2003) (Correct)
.... in resource allocation problems [13, 29] and in quantization theory [16, 21] The role of Voronoi tessellations and computational geometry in facility location is discussed in [23, 26] The notion and computational properties of the generalized gradient are throughly studied in nonsmooth analysis [9]. In particular, tools for establishing stability and convergence properties of nonsmooth dynamical systems are presented in [3, 15, 27] Finally, we refer to [7, 17] for guidelines on how to design dynamical systems for optimization purposes, and to [4] for gradient descent flows in distributed ....
....Voronoi configuration. We denote by Ed SP (V(P ) the set of edges of the Voronoi partition where the value SP (P ) is attained, i.e. e Ed SP (V(P ) if there exists i such that e Ed(V i (P ) and D e (p i ) SP (P ) 2.3. Nonsmooth analysis. The following facts on nonsmooth analysis [9] will be most helpful in analyzing the properties of the locational optimization functions for the disk covering and the sphere packing problems, as well as the convergence of the distributed algorithms we will propose to extremize them. R is said to be locally Lipschitz near if there ....
[Article contains additional citation context not shown here]
F. H. Clarke, Optimization and Nonsmooth Analysis, Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley & Sons, 1983.
An Inexact Trust-Region Feasible-Point Algorithm for.. - Hallabi, Tapia (1995) (Correct)
.... The locally Lipschitz composite function f = kFk a is regular, i.e. at any z and in any direction w in IR n Theta IR m , its generalized directional derivative, denoted by f 0 (z; w) and its one sided directional derivative, denoted by f 0 (z; w) exist and are equal (see Clarke [2]) They are respectively defined by (2.1) f 0 (z; w) lim sup z 0 z; t#0 f(z 0 tw) Gamma f(z 0 ) t and (2.2) f 0 (z; w) lim t#0 f(z tw) Gamma f(z) t : For more details concerning properties of the various derivatives of f = kFk a , we refer the reader to Clarke [2] In ....
....Clarke [2] They are respectively defined by (2.1) f 0 (z; w) lim sup z 0 z; t#0 f(z 0 tw) Gamma f(z 0 ) t and (2. 2) f 0 (z; w) lim t#0 f(z tw) Gamma f(z) t : For more details concerning properties of the various derivatives of f = kFk a , we refer the reader to Clarke [2]. In this research, we use both derivatives althought they are equal. To study the optimality conditions, working with the one sided directional derivative is sufficient. But to analyze the behavior of the algorithm near an iterate that is not a constrained stationary point of f , the generalized ....
F.H. Clarke, Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley and Sons Publications, 1983.
An Infeasible Primal-Dual Algorithm for TV-Based.. - Hintermüller, Stadler (2004) (Correct)
No context found.
F. Clarke, Optimization and nonsmooth analysis, Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley & Sons Inc., New York, 1983. A WileyInterscience Publication.
An Inexact Hybrid Algorithm for Nonlinear Systems of Equations - Hallabi (1994) (Correct)
No context found.
F.H. Clarke, Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley and Sons Publications, 1983.
An Inexact Hybrid Algorithm for Nonlinear Systems of Equations - Hallabi (1994) (Correct)
No context found.
F.H. Clarke, Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley and Sons Publications, 1983.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC