All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 24

Showing per page

Saddle point criteria for second order η -approximated vector optimization problems

Anurag Jayswal, Shalini Jha, Sarita Choudhury (2016)

Kybernetika

The purpose of this paper is to apply second order η -approximation method introduced to optimization theory by Antczak [2] to obtain a new second order η -saddle point criteria for vector optimization problems involving second order invex functions. Therefore, a second order η -saddle point and the second order η -Lagrange function are defined for the second order η -approximated vector optimization problem constructed in this approach. Then, the equivalence between an (weak) efficient solution of the...

Selection strategies in projection methods for convex minimization problems

Andrzej Cegielski, Robert Dylewski (2002)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

We propose new projection method for nonsmooth convex minimization problems. We present some method of subgradient selection, which is based on the so called residual selection model and is a generalization of the so called obtuse cone model. We also present numerical results for some test problems and compare these results with some other convex nonsmooth minimization methods. The numerical results show that the presented selection strategies ensure long steps and lead to an essential acceleration...

Slice convergence : stabilité et optimisation dans les espaces non réflexifs

Khalid El Hajioui, Driss Mentagui (2004)

ESAIM: Control, Optimisation and Calculus of Variations

Il est démontré par Mentagui [ESAIM : COCV 9 (2003) 297-315] que, dans le cas des espaces de Banach généraux, la convergence d’Attouch-Wets est stable par une classe d’opérations classiques de l’analyse convexe, lorsque les limites des suites d’ensembles et de fonctions satisfont certaines conditions de qualification naturelles. Ceci tombe en défaut avec la slice convergence. Dans cet article, nous établissons des conditions de qualification uniformes assurant la stabilité de la slice convergence...

Slice convergence: stabilité et optimisation dans les espaces non réflexifs

Khalid El Hajioui, Driss Mentagui (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Il est démontré par Mentagui [ESAIM: COCV9 (2003) 297-315] que, dans le cas des espaces de Banach généraux, la convergence d'Attouch-Wets est stable par une classe d'opérations classiques de l'analyse convexe, lorsque les limites des suites d'ensembles et de fonctions satisfont certaines conditions de qualification naturelles. Ceci tombe en défaut avec la slice convergence. Dans cet article, nous établissons des conditions de qualification uniformes assurant la stabilité de la slice convergence...

Sliding subspace design based on linear matrix inequalities

Alán Tapia, Raymundo Márquez, Miguel Bernal, Joaquín Cortez (2014)

Kybernetika

In this work, an alternative for sliding surface design based on linear and bilinear matrix inequalities is proposed. The methodology applies for reduced and integral sliding mode control, both continuous- and discrete-time; it takes advantage of the Finsler's lemma to provide a greater degree of freedom than existing approaches for sliding subspace design. The sliding surfaces thus constructed are systematically found via convex optimization techniques, which are efficiently implemented in commercially...

Smoothing a polyhedral convex function via cumulant transformation and homogenization

Alberto Seeger (1997)

Annales Polonici Mathematici

Given a polyhedral convex function g: ℝⁿ → ℝ ∪ +∞, it is always possible to construct a family g ₜ t > 0 which converges pointwise to g and such that each gₜ: ℝⁿ → ℝ is convex and infinitely often differentiable. The construction of such a family g ₜ t > 0 involves the concept of cumulant transformation and a standard homogenization procedure.

Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems

Jingyong Tang, Yuefen Chen (2022)

Applications of Mathematics

There has been much interest in studying symmetric cone complementarity problems. In this paper, we study the circular cone complementarity problem (denoted by CCCP) which is a type of nonsymmetric cone complementarity problem. We first construct two smoothing functions for the CCCP and show that they are all coercive and strong semismooth. Then we propose a smoothing algorithm to solve the CCCP. The proposed algorithm generates an infinite sequence such that the value of the merit function converges...

Solving convex program via Lagrangian decomposition

Matthias Knobloch (2004)

Kybernetika

We consider general convex large-scale optimization problems in finite dimensions. Under usual assumptions concerning the structure of the constraint functions, the considered problems are suitable for decomposition approaches. Lagrangian-dual problems are formulated and solved by applying a well-known cutting-plane method of level-type. The proposed method is capable to handle infinite function values. Therefore it is no longer necessary to demand the feasible set with respect to the non-dualized...

Sphärische Abbildung konvexer abgeschlossener Mengen in E n und ihre charakteristischen Eigenschaften

Libuše Grygarová (1978)

Aplikace matematiky

Nachdem der Begriff des sphärischen Bildes der Menge 𝐌 und der Begriff von sphärisch äquivalenten Mengen eingeführt wurde, werden verschiedene Zusammenhänge zwischen der Menge 𝐌 und ihrem sphärischen Bild untersucht und zwar unter verschiedenen Voraussetzung über 𝐌 (z. B. ihre Beschränkheit, Unbeschränkheit, strenge Konvexität). Die bewiesene Tatsache, dass die Menge 𝐌 und ihre ϵ -Umgebung sphärisch äquivalent sind, kann - sowie andere Ergebnisse der Arbeit - in der Theorie der konvexen parametrischen...

Strong-weak Stackelberg Problems in Finite Dimensional Spaces

Aboussoror, Abdelmalek, Loridan, Pierre (1995)

Serdica Mathematical Journal

We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation...

Currently displaying 1 – 20 of 24

Page 1 Next