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

Previous Page 4 Next

Displaying 61 – 80 of 86

Showing per page

Paraconvex functions and paraconvex sets

Huynh Van Ngai, Jean-Paul Penot (2008)

Studia Mathematica

We study a class of functions which contains both convex functions and differentiable functions whose derivatives are locally Lipschitzian or Hölderian. This class is a subclass of the class of approximately convex functions. It enjoys refined properties. We also introduce a class of sets whose associated distance functions are of that type. We discuss the properties of the metric projections on such sets under some assumptions on the geometry of the Banach spaces in which they are embedded. We...

Piecewise-polynomial signal segmentation using convex optimization

Pavel Rajmic, Michaela Novosadová, Marie Daňková (2017)

Kybernetika

A method is presented for segmenting one-dimensional signal whose independent segments are modeled as polynomials, and which is corrupted by additive noise. The method is based on sparse modeling, the main part is formulated as a convex optimization problem and is solved by a proximal splitting algorithm. We perform experiments on simulated and real data and show that the method is capable of reliably finding breakpoints in the signal, but requires careful tuning of the regularization parameters...

P-order necessary and sufficient conditions for optimality in singular calculus of variations

Agnieszka Prusińska, Alexey Tret'yakov (2010)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

This paper is devoted to singular calculus of variations problems with constraint functional not regular at the solution point in the sense that the first derivative is not surjective. In the first part of the paper we pursue an approach based on the constructions of the p-regularity theory. For p-regular calculus of variations problem we formulate and prove necessary and sufficient conditions for optimality in singular case and illustrate our results by classical example of calculus of variations...

Proč řešit graficky úlohy lineárního programování

Andrea Kubišová (2016)

Učitel matematiky

At universities focused on economy, Operation Research topics are usually included in the study plan, including solving of Linear Programming problems. A universal tool for their algebraic solution is (numerically difficult) Simplex Algorithm, for which it is necessary to know at least the fundamental of Matrix Algebra. To illustrate this method of solving LP problems and to discuss all types of results, it seems to be very convenient to include a chapter about graphic solutions to LP problems....

Shape optimization of elasto-plastic bodies

Zuzana Dimitrovová (2001)

Applications of Mathematics

Existence of an optimal shape of a deformable body made from a physically nonlinear material obeying a specific nonlinear generalized Hooke’s law (in fact, the so called deformation theory of plasticity is invoked in this case) is proved. Approximation of the problem by finite elements is also discussed.

Singularities and equicontinuity of certain families of set-valued mappings

Tiberiu Trif (1998)

Commentationes Mathematicae Universitatis Carolinae

In the present paper we establish an abstract principle of condensation of singularities for families consisting of set-valued mappings. By using it as a basic tool, the condensation of the singularities and the equicontinuity of certain families of generalized convex set-valued mappings are studied. In particular, a principle of condensation of the singularities of families of closed convex processes is derived. This principle immediately yields the uniform boundedness theorem stated in [1, Theorem...

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...

Structural Properties of Solutions to Total Variation Regularization Problems

Wolfgang Ring (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In dimension one it is proved that the solution to a total variation-regularized least-squares problem is always a function which is "constant almost everywhere" , provided that the data are in a certain sense outside the range of the operator to be inverted. A similar, but weaker result is derived in dimension two.

The Mean-Variance-CVaR model for Portfolio Optimization Modeling using a Multi-Objective Approach Based on a Hybrid Method

R. Aboulaich, R. Ellaia, S. El Moumen (2010)

Mathematical Modelling of Natural Phenomena

In this paper we present a new hybrid method, called SASP method. We propose the hybridization of two methods, the simulated annealing (SA), which belong to the class of global optimization based on the principles of thermodynamics, and the descent method were we estimate the gradient using the simultaneous perturbation. This hybrid method gives better results. We use the Normal Boundary Intersection approach (NBI) based on the SASP method to solve...

Theorems of the alternative for cones and Lyapunov regularity of matrices

Bryan Cain, Daniel Hershkowitz, Hans Schneider (1997)

Czechoslovak Mathematical Journal

Standard facts about separating linear functionals will be used to determine how two cones C and D and their duals C * and D * may overlap. When T V → W is linear and K ⊂ V and D ⊂ W are cones, these results will be applied to C = T ( K ) and D , giving a unified treatment of several theorems of the alternate which explain when C contains an interior point of D . The case when V = W is the space H of n × n Hermitian matrices, D is the n × n positive semidefinite matrices, and T ( X ) = A X + X * A yields new and known results about the existence of block diagonal...

Currently displaying 61 – 80 of 86