Nonsmooth Vector Optimization Problem Involving Second-Order Semipseudo, Semiquasi Cone-Convex Functions
نویسندگان
چکیده
منابع مشابه
On a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity
and Applied Analysis 3 Definition 2.2 see 16 . Let ψ : R → R be a locally Lipschitz function, then ψ◦ u;v denotes Clarke’s generalized directional derivative of ψ at u ∈ R in the direction v and is defined as ψ◦ u;v lim sup y→u t→ 0 ψ ( y tv ) − ψ(y) t . 2.4 Clarke’s generalized gradient of ψ at u is denoted by ∂ψ u and is defined as ∂ψ u { ξ ∈ R | ψ◦ u;v ≥ 〈ξ, v〉, ∀v ∈ Rn}. 2.5 Let f : R → R b...
متن کاملSparse Second Order Cone Programming Formulations for Convex Optimization Problems
Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur com...
متن کاملSecond-order nonsmooth optimization for H ∞ synthesis
The standard way to compute H∞ feedback controllers uses algebraic Riccati equations and is therefore of limited applicability. Here we present a new approach to the H∞ output feedback control design problem, which is based on nonlinear and nonsmooth mathematical programming techniques. Our approach avoids the use of Lyapunov variables, and is therefore flexible in many practical situations.
متن کاملHigher Order Duality for Vector Optimization Problem over Cones Involving Support Functions
In this paper, we consider a vector optimization problem over cones involving support functions in objective as well as constraints and associate a unified higher order dual to it. Duality result have been established under the conditions of higher order cone convex and related functions. A number of previously studied problems appear as special cases.
متن کاملA second order primal-dual method for nonsmooth convex composite optimization
We develop a second order primal-dual method for optimization problems in which the objective function is given by the sum of a strongly convex twice differentiable term and a possibly nondifferentiable convex regularizer. After introducing an auxiliary variable, we utilize the proximal operator of the nonsmooth regularizer to transform the associated augmented Lagrangian into a function that i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2020
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic-2310-5070-839