second order directional derivative
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 1)

H-INDEX

5
(FIVE YEARS 0)

Author(s):  
Gabriel Ruiz-Garzón ◽  
Jaime Ruiz-Zapatero ◽  
Rafaela Osuna-Gómez ◽  
Antonio Rufián-Lizana

This work is intended to lead a study of necessary and sufficient optimality conditions for scalar optimization problems on Hadamard manifolds. In the context of this geometry, we obtain and present new function types characterized by the property of having all their second-order stationary points to be global minimums. In order to do so, we extend the concept convexity in Euclidean space to a more general notion of invexity on Hadamard manifolds. This is done employing notions of second-order directional derivative, second-order pseudoinvexity functions and the second-order Karush-Kuhn-Tucker-pseudoinvexity problem. Thus, we prove that every second-order stationary point is a global minimum if and only if the problem is either second-order pseudoinvex or second-order KKT-pseudoinvex depending on whether the problem regards unconstrained or constrained scalar optimization respectively. This result has not been presented in the literature before. Finally, examples of these new characterizations are provided in the context of \textit{"Higgs Boson like"} potentials among others.


2016 ◽  
Vol 37 (9) ◽  
pp. 1142-1151
Author(s):  
赵爱罡 ZHAO Ai-gang ◽  
王宏力 WANG Hong-li ◽  
杨小冈 YANG Xiao-gang ◽  
陆敬辉 LU Jing-hui ◽  
姜伟 JIANG Wei ◽  
...  

2012 ◽  
Vol 2012 ◽  
pp. 1-9
Author(s):  
Huijuan Xiong ◽  
Yu Xiao ◽  
Chaohong Song

Sufficient optimality and sensitivity of a parameterized min-max programming with fixed feasible set are analyzed. Based on Clarke's subdifferential and Chaney's second-order directional derivative, sufficient optimality of the parameterized min-max programming is discussed first. Moreover, under a convex assumption on the objective function, a subdifferential computation formula of the marginal function is obtained. The assumptions are satisfied naturally for some application problems. Moreover, the formulae based on these assumptions are concise and convenient for algorithmic purpose to solve the applications.


1996 ◽  
Vol 53 (1) ◽  
pp. 21-32 ◽  
Author(s):  
X. Q. Yang

In this paper, a second-order characterisation of η-convex C1, 1 functions is derived in a Hilbert space using a generalised second-order directional derivative. Using this result it is then shown that every C1, 1 function is locally weakly convex, that is, every C1, 1 real-valued function f can be represented as f (x) = h (x) − η‖x‖2 on a neighbourhood of x where h is a convex function and η > 0. Moreover, a characterisation of the generalised second-order directional derivative for max functions is given.


Sign in / Sign up

Export Citation Format

Share Document