Relevant bibliographies by topics / Analyse convexe

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Analyse convexe'

Author: Grafiati
Published: 4 June 2021
Last updated: 2 November 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Analyse convexe.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Analyse convexe"

1

Granas, Andrzej. "Sur un principe géométrique en analyse convexe." Studia Mathematica 101, no. 1 (1991): 1–18. http://dx.doi.org/10.4064/sm-101-1-1-18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Deguire, Paul, and Andrzej Granas. "Sur une certaine alternative non-linéaire en analyse convexe." Studia Mathematica 83, no. 2 (1986): 127–38. http://dx.doi.org/10.4064/sm-83-2-127-138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barré, C., J. M. André, P. Jonnard, and C. Bonnelle. "Analyse spatiale d'une source X à l'aide d'un spectromètre à cristal convexe." X-Ray Spectrometry 24, no. 5 (September 1995): 260–66. http://dx.doi.org/10.1002/xrs.1300240510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Clément, Benoît. "Analyse par intervalles et optimisation convexe pour résoudre un problème général de faisabilité d’une contrainte robuste." Journal Européen des Systèmes Automatisés 46, no. 4-5 (July 30, 2012): 381–95. http://dx.doi.org/10.3166/jesa.46.381-395.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Popovici, Nicolae. "Convexité au sens direct ou inverse et applications dans l'optimisation vectorielle." Journal of Numerical Analysis and Approximation Theory 29, no. 1 (February 1, 2000): 75–82. http://dx.doi.org/10.33993/jnaat291-656.

Full text
Abstract:
(in English) The aim of this paper is to study vector optimization poblems involving objective functions which are convex in some direct or inverse sense (i.e. a special class of cone-quasiconvex functions). In particular, it is shown that the image of the objective function is a cone-convex set, property which is important from the scalarization point of view in vector optimization. (in French) Le but de cet article est d'etudier les problemes d'optimisation vectorielles ayant des fonctions objectifs convexes au sens direct ou inverse. Il s'agit notamment de donner des conditions suffisantes pour que l'image d'un ensemble convexe par des fonction objectifs cone-quasiconvexes soit un ensemble cone-convexe, propriete qui joue un role important dans la plupart des methodes de scalarisation utilisees dans l'optimisation vectorielle.
APA, Harvard, Vancouver, ISO, and other styles
6

Jin, Chi, Praneeth Netrapalli, Rong Ge, Sham M. Kakade, and Michael I. Jordan. "On Nonconvex Optimization for Machine Learning." Journal of the ACM 68, no. 2 (March 2021): 1–29. http://dx.doi.org/10.1145/3418526.

Full text
Abstract:
Gradient descent (GD) and stochastic gradient descent (SGD) are the workhorses of large-scale machine learning. While classical theory focused on analyzing the performance of these methods in convex optimization problems, the most notable successes in machine learning have involved nonconvex optimization, and a gap has arisen between theory and practice. Indeed, traditional analyses of GD and SGD show that both algorithms converge to stationary points efficiently. But these analyses do not take into account the possibility of converging to saddle points. More recent theory has shown that GD and SGD can avoid saddle points, but the dependence on dimension in these analyses is polynomial. For modern machine learning, where the dimension can be in the millions, such dependence would be catastrophic. We analyze perturbed versions of GD and SGD and show that they are truly efficient—their dimension dependence is only polylogarithmic. Indeed, these algorithms converge to second-order stationary points in essentially the same time as they take to converge to classical first-order stationary points.
APA, Harvard, Vancouver, ISO, and other styles
7

Klaričić Bakula, Milica, and Kazimierz Nikodem. "Converse Jensen inequality for strongly convex set-valued maps." Journal of Mathematical Inequalities, no. 2 (2018): 545–50. http://dx.doi.org/10.7153/jmi-2018-12-40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Acu, Ana-Maria, Margareta Heilmann, and Ioan Rasa. "Strong Converse Results for Linking Operators and Convex Functions." Journal of Function Spaces 2020 (December 5, 2020): 1–5. http://dx.doi.org/10.1155/2020/4049167.

Full text
Abstract:
We consider a family B n , ρ c of operators which is a link between classical Baskakov operators (for ρ = ∞ ) and their genuine Durrmeyer type modification (for ρ = 1 ). First, we prove that for fixed n , c and a fixed convex function f , B n , ρ c f is decreasing with respect to ρ . We give two proofs, using various probabilistic considerations. Then, we combine this property with some existing direct and strong converse results for classical operators, in order to get such results for the operators B n , ρ c applied to convex functions.
APA, Harvard, Vancouver, ISO, and other styles
9

Ceng, Lu-Chuan, and Ching-Feng Wen. "Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems with Generalized Mixed Equilibrium Problems." Journal of Function Spaces and Applications 2012 (2012): 1–26. http://dx.doi.org/10.1155/2012/678353.

Full text
Abstract:
It is well known that the gradient-projection algorithm (GPA) for solving constrained convex minimization problems has been proven to have only weak convergence unless the underlying Hilbert space is finite dimensional. In this paper, we introduce a new hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems in a real Hilbert space. It is proven that three sequences generated by this algorithm converge strongly to the unique solution of some variational inequality, which is also a common element of the set of solutions of a constrained convex minimization problem, the set of solutions of a generalized mixed equilibrium problem, and the set of fixed points of a strict pseudocontraction in a real Hilbert space.
APA, Harvard, Vancouver, ISO, and other styles
10

Klaričić Bakula, Milica, and Kazimierz Nikodem. "On the converse Jensen inequality for strongly convex functions." Journal of Mathematical Analysis and Applications 434, no. 1 (February 2016): 516–22. http://dx.doi.org/10.1016/j.jmaa.2015.09.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Analyse convexe"

1

DANIILIDIS, Aris. "Analyse convexe et quasi-convexe ; applications en optimisation." Habilitation à diriger des recherches, Université de Pau et des Pays de l'Adour, 2002. http://tel.archives-ouvertes.fr/tel-00001355.

Full text
Abstract:
Ce document de synthèse s'articule autour de l'analyse convexe, de l'analyse quasi-convexe et des applications en optimisation. Dans le premier domaine on aborde les thèmes de la continuité, de la différentiabilité et des critères de coïncidence pour les fonctions convexes, puis la convexification des fonctions semi-continues inférieurement. Pour l'étude des fonctions quasi-convexes deux approches sont adoptées : une approche analytique, via un sous-différentiel généralisé, et une approche géométrique, basée sur les normales aux tranches. La dernière partie est consacrée à des applications à l'intégration d'opérateurs multivoques, aux inéquations variationnelles et à des problèmes d'optimisation multicritères en dimension finie et infinie. Parmi les nouveautés de ce travail, on trouve la notion de monotonie fortement cyclique, qui caractérise le sous-différentiel d'une fonction convexe dont la restriction à son domaine est continue, la quasi-monotonie cyclique, qui est une propriété intrinsèque du sous-différentiel d'une fonction quasi-convexe avec des applications importantes en économie mathématique, et la notion de quasi-monotonie propre, qui caractérise les opérateurs pour lesquels l'inéquation variationnelle associée a toujours des solutions sur toute sous-partie convexe et faiblement compacte de leur domaine. Notons encore une nouvelle caractérisation de la propriété de Radon-Nikodym, et une extension à la dimension infinie d'un résultat de Janin concernant l'intégration d'un opérateur maximal cycliquement sous-monotone, résultat qui généralise le théorème classique de Rockafellar pour les opérateurs maximaux cycliquement monotones.
APA, Harvard, Vancouver, ISO, and other styles
2

Thomasse, Rémy. "Analyse de complexité d'enveloppes convexes aléatoires." Thesis, Nice, 2015. http://www.theses.fr/2015NICE4116/document.

Full text
Abstract:
Dans cette thèse, nous donnons de nouveaux résultats sur la taille moyenne d’enveloppes convexes de points choisis dans un convexe. Cette taille est connue lorsque les points sont choisis uniformément (et indépendamment) dans un polytope convexe, ou un convexe suffisamment «lisse» ; ou encore lorsque les points sont choisis indépendamment selon une loi normale centrée. Dans la première partie de cette thèse, nous développons une technique nous permettant de donner de nouveaux résultats lorsque les points sont choisis arbitrairement dans un convexe, puis «bruités» par une perturbation aléatoire. Ce type d’analyse, appelée analyse lissée, a initialement été développée par Spielman et Teng dans leur étude de l’algorithme du simplexe. Pour un ensemble de points arbitraires dans une boule, nous obtenons une borne inférieure et une borne supérieure de cette complexité lissée dans le cas de perturbations uniformes dans une boule en dimension arbitraire, ainsi que dans le cas de perturbations gaussiennes en dimension 2. La taille de l'enveloppe convexe de points choisis uniformément dans un convexe, peut avoir un comportement logarithmique si ce convexe est un polytope ou polynomial s’il est lisse. Nous construisons un convexe produisant un comportement oscillant entre ces deux extrêmes. Dans la dernière partie, nous présentons un algorithme pour engendrer efficacement une enveloppe convexe aléatoire de points choisis uniformément et indépendamment dans un disque sans avoir à engendrer explicitement tous les points. Il a été implémenté en C++ et intégré dans la bibliothèque CGAL
In this thesis, we give some new results about the average size of convex hulls made of points chosen in a convex body. This size is known when the points are chosen uniformly (and independently) in a convex polytope or in a "smooth" enough convex body. This average size is also known if the points are independently chosen according to a centered Gaussian distribution. In the first part of this thesis, we introduce a technique that will give new results when the points are chosen arbitrarily in a convex body, and then noised by some random perturbations. This kind of analysis, called smoothed analysis, has been initially developed by Spielman and Teng in their study of the simplex algorithm. For an arbitrary set of point in a ball, we obtain a lower and a upper bound for this smoothed complexity, in the case of uniform perturbation in a ball (in arbitrary dimension) and in the case of Gaussian perturbations in dimension 2. The asymptotic behavior of the expected size of the convex hull of uniformly random points in a convex body is polynomial for a "smooth" body and polylogarithmic for a polytope. In the second part, we construct a convex body so that the expected size of the convex hull of points uniformly chosen in that body oscillates between these two behaviors when the number of points increases. In the last part, we present an algorithm to generate efficiently a random convex hull made of points chosen uniformly and independently in a disk. We also compute its average time and space complexity. This algorithm can generate a random convex hull without explicitly generating all the points. It has been implemented in C++ and integrated in the CGAL library
APA, Harvard, Vancouver, ISO, and other styles
3

SAADA, DIANE. "Modelisation stochastique, analyse convexe et finance." Paris 6, 1994. http://www.theses.fr/1994PA066255.

Full text
Abstract:
Cette these est constituee de quatre articles qui ont pour points de rencontre le calcul stochastique et la finance. Le premier s'inscrit dans une approche qualifiee de la finance aux mathematiques. Il permet de caracteriser, par polarite, l'ensemble d'observabilite d'un processus contraint tant par l'etat que par son coefficient de diffusion. Les autres s'inscrivent dans l'approche inverse, des mathematiques a la finance, c'est-a-dire qu'ils utilisent des outils de controle et processus stochastiques, ainsi que d'analyse fonctionnelle et convexe, pour resoudre des problemes de finance. Le deuxieme donc, traite la maximisation de l'utilite de la richesse terminale, dans un marche sous frictions. Le troisieme propose une modelisation en temps discret de la structure par terme des taux. Enfin le dernier donne la resolution du pricing d'une option de remboursement anticipe
APA, Harvard, Vancouver, ISO, and other styles
4

Guillaume, Sophie. "Problèmes d'optimisation et d'évolution en analyse non convexe de type convexe composite." Montpellier 2, 1996. http://www.theses.fr/1996MON20224.

Full text
Abstract:
Cette these est consacree a l'etude de fonctions non necessairement convexes ni regulieres, a savoir les fonctions s'ecrivant comme la composition d'une fonction convexe semicontinue inferieurement avec une application lisse. Sous une condition de qualification, une telle ecriture permet d'utiliser les resultats connus de l'analyse convexe, et de modeliser de nombreux exemples: programmation mathematique non lineaire, problemes avec obstacle, polyconvexite en calcul des variations, problemes de valeurs propres. On etudie, pour ces fonctions dites convexes composites qualifiees, leurs principales proprietes et leurs liens avec d'autres classes de fonctions non convexes, ainsi que divers problemes d'evolution et d'optimisation
APA, Harvard, Vancouver, ISO, and other styles
5

Melliani, Mohamed. "Analyse numérique d'algorithmes proximaux généralisés en optimisation convexe." Rouen, 1997. http://www.theses.fr/1997ROUES030.

Full text
Abstract:
La thèse a pour objet l'étude d'une généralisation de l'algorithme du point proximal en optimisation convexe tant d'un point de vue théorique que numérique. L'équivalent de cette généralisation pour l'algorithme de Tikhonov est également proposé. S'inscrivant, dans un premier temps, dans le cadre de la convergence variationnelle, la méthode proximale généralisée est tout d'abord combinée avec les méthodes des pénalités. Puis, lorsqu'appliquée au problème dual, elle permet d'obtenir de nouvelles méthodes de multiplicateurs, différentes de celles introduites par Eckstein et Teboulle. Ces méthodes des multiplicateurs englobent, en particulier, la méthode de Hestenes et Powell, celle de Rockafellar et certaines des méthodes de Kort et Bertsekas.
APA, Harvard, Vancouver, ISO, and other styles
6

Cadoux, Florent. "Optimisation et analyse convexe pour la dynamique non-régulière." Phd thesis, Grenoble 1, 2009. http://www.theses.fr/2009GRE10231.

Full text
Abstract:
L'objectif de ce travail est de proposer une nouvelle approche pour la résolution du problème de contact unilatéral avec frottement de Coulomb tridimensionnel en mécanique des solides. On s'intéresse à des systèmes dynamiques composés de plusieurs corps possédant un nombre fini de degrés de liberté: rigides, ou déformables qui sont des approximations spatiales de modèles continus. Le frottement entre les corps est modélisé en utilisant une formulation classique de la loi de Coulomb. Après discrétisation en temps (ou approximation quasi-statique), on obtient à chaque pas de temps un problème contenant des équations de complémentarité sur un produit de cônes du second ordre, et d'autres équations. Plusieurs méthodes de résolution ont été proposées pour différentes formulations équivalentes de ce problème, en particulier par Moreau, Alart et Curnier, et De Saxcé. En considérant les équations de complémentarité comme celles des conditions d'optimalité (KKT) d'un problème d'optimisation, on propose une reformulation équivalente nouvelle sous forme d'un problème de minimisation paramétrique convexe couplé avec un problème de point fixe. Grâce à ce point de vue, on démontre l'existence de solutions sous une hypothèse assez faible, et vérifiable en pratique. De plus, on peut souvent calculer effectivement l'une de ces solutions en résolvant numériquement l'équation de point fixe. Les performances de cette approche sont comparées à celles des méthodes existantes
The aim of this work is to propose a new approach to the solution of 3D unilateral contact problems with Coulomb friction in solid mechanics. We consider dynamical systems composed of several bodies with a finite number of degrees of freedom: rigid bodies, or deformable bodies which are spatial approximations of continuous models. Friction between bodies is modelled using a classical formulation of Coulomb's law. After time discretization (or quasi-static approximation), we get at each time step a problem containing complementarity equations posed on a product of second order cones, plus other equations. Several methods have been proposed in the literature for different equivalent formulations of this problem, in particular by Moreau, Alart and Curnier, and De Saxcé. Considering the complementarity equations as optimality conditions (KKT) of an optimization problem, we propose a new equivalent reformulation as a parametric convex minimization problem coupled with a fixed point problem. Thanks to this viewpoint, we prove the existence of solutions under a quite mild assumption which can be checked in practice. Moreover, we can practically compute one of these solutions by solving numerically the fixed point equation. The performance of this approach is compared with existing methods
APA, Harvard, Vancouver, ISO, and other styles
7

Cadoux, Florent. "Optimisation et analyse convexe pour la dynamique non-régulière." Phd thesis, Université Joseph Fourier (Grenoble), 2009. http://tel.archives-ouvertes.fr/tel-00440798.

Full text
Abstract:
L'objectif de ce travail est de proposer une nouvelle approche pour la résolution du problème de contact unilatéral avec frottement de Coulomb tridimensionnel en mécanique des solides. On s'intéresse à des systèmes dynamiques composés de plusieurs corps possédant un nombre fini de degrés de liberté: rigides, ou déformables qui sont des approximations spatiales de modèles continus. Le frottement entre les corps est modélisé en utilisant une formulation classique de la loi de Coulomb. Après discrétisation en temps (ou approximation quasi-statique), on obtient à chaque pas de temps un problème contenant des équations de complémentarité sur un produit de cônes du second ordre, et d'autres équations. Plusieurs méthodes de résolution ont été proposées pour différentes formulations équivalentes de ce problème, en particulier par Moreau, Alart et Curnier, et De Saxcé. En considérant les équations de complémentarité comme celles des conditions d'optimalité (KKT) d'un problème d'optimisation, on propose une reformulation équivalente nouvelle sous forme d'un problème de minimisation paramétrique convexe couplé avec un problème de point fixe. Grâce à ce point de vue, on démontre l'existence de solutions sous une hypothèse assez faible, et vérifiable en pratique. De plus, on peut souvent calculer effectivement l'une de ces solutions en résolvant numériquement l'équation de point fixe. Les performances de cette approche sont comparées à celles des méthodes existantes.
APA, Harvard, Vancouver, ISO, and other styles
8

Hbaïeb, Slim. "Analyse de cahier des charges en automatique par optimisation convexe." Paris 11, 2002. http://www.theses.fr/2002PA112137.

Full text
Abstract:
Les travaux présentés dans ce mémoire portent sur l'analyse de faisabilité de cahier des charges en automatique linéaire continu. Deux approches ont été développées : une approche "trajectoires" qui permet d'étudier les limites de performances intrinsèques atteignables en entrées sorties d'un système, et une approche "transfert" qui permet d'étudier la compatibilité de spécifications temporelles et fréquentielles exprimées en entrées sorties du système bouclé. Cette deuxième approche utilise la paramétrisation de Youla. Une interprétation physique basée sur une présentation originale est présentée. Un formalisme mathématique pour l'approximation des problèmes d'optimisation de dimensions infinies a été développé. Nous avons distingué deux classes d'approximation : avec garantie de convergence simple et avec garantie de convergence uniforme. Les deux permettent de résoudre de manière effective les problèmes d'optimisations considérés. Nous présentons et comparons les avantages et les inconvénients de ces approches. Des expressions en dimensions finies de ces problèmes sous formes linéaires, quadratiques ou LMI ont été développées pour la résolution numérique. Les techniques développées ont en particulier été appliquées pour un cas industriel : "la régulation du niveau d'eau dans un générateur de vapeur pour un réacteur à eau pressurisé". Ce travail a été mené en collaboration avec le département contrôle commande EDF Chatou
This PhD thesis deals with the analysis of specifications for linear continuous time control design. Two complementary approaches are developed: the first uses the input output trajectories as parameters and allows to study the limits of performances reachable by a given system; the second uses closed loop transfers as parameters and allows to analyze compatibility of several input output demands in time and frequency domains. A physical interpretation of Youla parameterization, used in this approach, is introduced too. A mathematical framework for finite dimensional approximation problems is developed. Tow kind of approximations were formulated: the first has simple convergence properties and the second has uniform convergence properties. Both allow to solve effectively the considered optimization problems. Advantages and drawbacks of each approach are presented and compared. Finite dimensional formulation in term of linear, quadratic or LM constrained optimization problems are developed for numerical application. These techniques are applied to an industrial case: "the steam generator water level control of a pressurized water reactor". This study was realized in collaboration with the department of "controle commande EDF Chatou". Keywords: feasibility, specifications, convex optimization, linear system, Youla parameterization, finite dimensional approximation, steam generator
APA, Harvard, Vancouver, ISO, and other styles
9

Lassoued, Rym. "Comportement hivernal des chaussées : modélisation thermique." Marne-la-Vallée, ENPC, 2000. http://www.theses.fr/2000ENPC0019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Daldoul, Mabrouk. "Contribution aux méthodes proximales et applications à la régression linéaire l1." Dijon, 1995. http://www.theses.fr/1995DIJOS042.

Full text
Abstract:
Le premier chapitre rassemble quelques éléments d'analyse convexe. On rappelle les principaux résultats sur la dualité de Fenchel en adoptant un point de vue non classique, ce qui conduit à des preuves plus simples et moins techniques. Le deuxième chapitre est consacré à une analyse de la convergence de méthodes proximales. On montre, en particulier que l'algorithme proximal généralise, introduit par C. D. Ha, engendre une suite minimisante même en absence de solution. On montre aussi la convergence finie de l'algorithme de Tichonov pour un opérateur dont l'inverse possède la propriété diff-max. Enfin on s'intéresse à l'algorithme de l'inverse partiel en améliorant le résultat de convergence finie. Le chapitre 3 propose une nouvelle approche, pour résoudre le problème de régression linéaire l1. Le point de vue proximal adopte permet de développer plusieurs algorithmes nouveaux qui présentent l'avantage d'être facilement implémentables, de pouvoir traiter une grande variété de contraintes (linéaires ou non linéaires), et d'être parallélisables, ce qui est aussi un avantage pour les problèmes de grandes tailles. On consacre un paragraphe au problème de l'm-estimateur de Huber en donnant un résultat sur le lien entre solutions du problème l1 et solutions du problème de Huber. La partie 4 est une annexe qui contient les programmes en Matlab pour le problème de régression l1 et des résultats numériques
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Analyse convexe"

1

Willem, Michel. Analyse convexe et optimisation. [S.l.]: CIACO, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Willem, Michel. Analyse convexe et optimisation. 3rd ed. Louvain-la-Neuve: CIACO, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hiriart-Urruty, Jean-Baptiste. Optimisation et analyse convexe: Exercices et problèmes corrigés, avec rappels de cours. Les Ulis: EDP sciences, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Andrzej, Granas, Université de Montréal. Département de mathématiques et de statistique., and NATO Advanced Study Institute, eds. Méthodes topologiques en analyse convexe: Partie 3 des comptes rendus du cours d'été OTAN "Variational methods in nonlinear problems". Montréal: Presses de l'Université de Montréal, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rockafellar, Ralph Tyrell. Convex Analysis. Princeton, NJ, USA: Princeton University Press, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liese, Friedrich. Convex statistical distances. Leipzig, Germany: Teubner, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bhooshan, Upadhyay Balendu, ed. Pseudolinear functions and optimization. Boca Raton: CRC Press, Taylor & Francis Group, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Çınlar, E. Real and Convex Analysis. Boston, MA: Springer US, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

José, Bonet, ed. Barrelled locally convex spaces. Amsterdam: North-Holland, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

1944-, Lemaréchal Claude, ed. Fundamentals of convex analysis. Berlin: Springer, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Analyse convexe"

1

Hiriart-Urruty, Jean-Baptiste. "ANALYSE CONVEXE OPÉRATOIRE." In Bases, outils et principes pour l'analyse variationnelle, 85–116. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30735-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Giaquinta, Mariano, and Giuseppe Modica. "Convex Sets and Convex Functions." In Mathematical Analysis, 67–148. Boston: Birkhäuser Boston, 2011. http://dx.doi.org/10.1007/978-0-8176-8310-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Borwein, Jonathan M., and Adrian S. Lewis. "Convex Analysis." In Convex Analysis and Nonlinear Optimization, 65–96. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4757-9859-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vanderbei, Robert J. "Convex Analysis." In International Series in Operations Research & Management Science, 161–71. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-74388-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kutateladze, S. S. "Convex Analysis." In Fundamentals of Functional Analysis, 20–39. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-015-8755-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vanderbei, Robert J. "Convex Analysis." In International Series in Operations Research & Management Science, 159–69. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39415-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bagirov, Adil, Napsu Karmitsa, and Marko M. Mäkelä. "Convex Analysis." In Introduction to Nonsmooth Optimization, 11–60. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08114-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vanderbei, Robert J. "Convex Analysis." In International Series in Operations Research & Management Science, 161–71. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-5662-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vanderbei, Robert J. "Convex Analysis." In International Series in Operations Research & Management Science, 141–50. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-7630-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Solomon, Indu, and Uttam Kumar. "Convex Analysis." In Encyclopedia of Mathematical Geosciences, 1–5. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-26050-7_67-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Analyse convexe"

1

Gonzalez, Germanico, Hugo I. Medellin, Theodore Lim, James M. Ritchie, and Raymond C. W. Sung. "3D Object Representation for Physics Simulation Engines and its Effect on Virtual Assembly Tasks." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71120.

Full text
Abstract:
Physical based modelling (PBM) uses physics simulation engines (PSE) to provide the dynamic behaviour and collision detection of virtual objects in virtual environments emulating the real world. There exists a variety of PSEs, each one with pros and cons according to the application in which they are employed. Each physics engine uses its proprietary collision detection algorithm. Collision detection is a key aspect of assembly tasks and its performance is dependent on the way virtual objects are represented. In general, objects can be divided into two groups: convex and concave, the latter being the most common and challenging for collision detection algorithms. This study reports on three different methods to represent concave objects. GIMPACT, Hierarchical Approximate Convex Decomposition (HACD) and Approximate Convex Decomposition (ACD), which are evaluated and compared based on their collision detection performances. An exact convex decomposition algorithm, named as ConvexFT, is also proposed and analyzed in this paper. Finally the performance of the three existing methods and the ConvexFT proposed approach are compared in order to assess which model representation algorithm is best suited for haptic-virtual assembly tasks.
APA, Harvard, Vancouver, ISO, and other styles
2

Felgueiras, Miguel, João Martins, and Rui Santos. "Pseudo-convex mixtures." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alonso-Gutiérrez, David, and Jesús Bastero. "Convex inequalities, isoperimetry and spectral gap." In VI International Course of Mathematical Analysis in Andalusia. WORLD SCIENTIFIC, 2016. http://dx.doi.org/10.1142/9789813147645_0001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vlachkova, Krassimira. "Interpolation of convex scattered data in ℝ3 using edge convex minimum L∞-norm networks." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2021. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0162400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sulaiman, W. T. "On Integral Inequalities Concerning Convex and Concave Functions." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2008. American Institute of Physics, 2008. http://dx.doi.org/10.1063/1.2990974.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Karakuş, Mahmut. "On generalized quasi-convex bounded sequences." In INTERNATIONAL CONFERENCE ON ANALYSIS AND APPLIED MATHEMATICS (ICAAM 2016). Author(s), 2016. http://dx.doi.org/10.1063/1.4959679.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Qi, Pinghua Gong, Shiyu Chang, Thomas S. Huang, and Jiayu Zhou. "Robust Convex Clustering Analysis." In 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE, 2016. http://dx.doi.org/10.1109/icdm.2016.0170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ole, Yesaya Putra Dappa, Sofihara Al Hazmy, and Al Azhary Masta. "Geometric interpretation of S-convex function on ℝ." In INTERNATIONAL CONFERENCE ON MATHEMATICAL ANALYSIS AND ITS APPLICATIONS 2022 (IConMAA 2022): Analysis, Uncertainty, and Optimization. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0198870.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sulaiman, W. T. "Hardy‐Hilbert’s Integral Inequalities for Convex and Concave Functions." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2008. American Institute of Physics, 2008. http://dx.doi.org/10.1063/1.2990975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ding, Hua, Ninggang Shen, Keqin Li, Wu Bo, Chelsey N. Pence, and Hongtao Ding. "Experimental and Numerical Analysis of Laser Peen Forming Mechanisms of Sheet Metal." In ASME 2014 International Manufacturing Science and Engineering Conference collocated with the JSME 2014 International Conference on Materials and Processing and the 42nd North American Manufacturing Research Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/msec2014-4210.

Full text
Abstract:
Laser peen forming (LPF) is a novel non-contact sheet metal forming process without detrimental thermal defects. High pressure shock waves induced by a focused laser pulse are applied on the workpiece surface to generate deformations. In this study, the deformation mechanisms induced by LPF are experimentally and numerically investigated under different experimental conditions. Experiments have shown that when keeping laser parameters constant, deformation mechanisms vary depending on the sample thickness. The results show that aluminum sheet samples of 0.25 mm in thickness bend concavely for pulse energy ranging from 0.2 to 0.5 J, while 1.75 mm aluminum sheets bend convexly under the same conditions. There is a transition thickness threshold of sheet metal at which the deformation mechanism changes from concave to convex with the increase of the sample thickness with certain levels of laser parameter. This transition thickness threshold is determined to be around 0.7–0.88mm with the studied process parameters. Experiments also show that as the pulse energy increases, the transition thickness of the bending deformation mechanism increases slightly. Under the concave deformation mechanism, the workpiece is more sensitive to pulse energy, while pulse energy is not a critical factor in the convex mechanism. A finite element analysis (FEA) is performed to simulate the LPF deformation process with different specimen thicknesses and loading conditions. The simulation results agreed well with experimental results.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Analyse convexe"

1

Robinson, Adam. Helly's Theorem and Its Equivalences via Convex Analysis. Portland State University Library, January 2014. http://dx.doi.org/10.15760/honors.62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Briones, Roehlano, Ivory Myka Galang, Isabel Espineli, Aniceto Jr Orbeta, and Marife Ballesteros. Endline Study Report and Policy Study for the ConVERGE Project. Philippine Institute for Development Studies, September 2023. http://dx.doi.org/10.62986/dp2023.13.

Full text
Abstract:
The Department of Agrarian Reform (DAR), in partnership with the International Fund for Agricultural Development, implemented the project Convergence on Value Chain Enhancement for Rural Growth and Empowerment (ConVERGE) with the goal of empowering Agrarian Reform Beneficiaries (ARBs) to drive rural economic growth across 10 provinces spanning 3 regions. DAR engaged the Philippine Institute for Development Studies to undertake baseline and endline studies, serving as a crucial assessment tool for the project's performance and providing insights to inform the comprehensive ARC Cluster Development (ARCCD) Strategy aimed at advancing smallholder agriculture in the Philippines. This endline report provides the analysis of the baseline and endline datasets. It discusses the following key points: (i) results of the impact evaluation study, (ii) result of final process evaluation, and (iii) recommendations for the ARCCD Strategy. ​ The quantitative analysis part of the study indicates a significant 41-percent average treatment effect from the project, validating its theory of change in boosting income for ARC cluster households through value chain interventions. The process evaluation generally confirms the assumptions and impact pathways, with some deviations and shortfalls. Although the beneficiaries express satisfaction with the project, they have limited understanding of its rationale. The clustering method, which links small farmers to value chains by forming ARBs into lead and participating ARB organizations (ARBOs), appears to enhance government support efficiency for organized groups. The paper underscores the importance of additional capacity building for both lead and participating ARBOs, and it recommends a more active engagement of other government agencies to address value-adding technologies, food processing standards, credit accessibility, and market facilitation.
APA, Harvard, Vancouver, ISO, and other styles
3

Michael, Chris J., Elias Z. Ioup, and David W. Dobson. Customized Architecture for Complex Routing Analysis: Case Study for the Convey Hybrid-Core Computer. Fort Belvoir, VA: Defense Technical Information Center, February 2014. http://dx.doi.org/10.21236/ada596742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Valev, Radoslav. Resurgence of Expansionist Tsarism: Populist Autocracy in Russia. European Center for Populism Studies (ECPS), June 2024. http://dx.doi.org/10.55271/rp0057.

Full text
Abstract:
The thirteenth event in ECPS’s monthly Mapping Global Populism (MGP) panel series, titled “Resurgence of Expansionist Tsarism: Populist Autocracy in Russia,” convened online on May 30, 2024. This event delved into the evolving political landscape of Russia. Moderated by Dr. Maxine David, a respected lecturer in European Studies at Leiden University and a foreign policy analyst specializing in Russian and EU foreign policy, the panel featured a distinguished line-up of scholars who provided unique insights into Russia’s populist autocracy from diverse disciplinary perspectives.
APA, Harvard, Vancouver, ISO, and other styles
5

Izhar, Hylmun, and Turkhan Abdul Manap. Saudi Arabia Poised to Become a Global Leader in Islamic Finance. Islamic Development Bank Institute, December 2020. http://dx.doi.org/10.55780/re24014.

Full text
Abstract:
The Kingdom of Saudi Arabia, being the largest Islamic finance market globally in economies with dual financial systems (comprising both conventional and Islamic financial sectors) is poised to become a global leader in the Islamic financial services industry. This is one of the key messages that is conveyed by the first detailed analysis of Islamic finance in Saudi Arabia, a flagship initiative of the Islamic Research and Training Institute (IRTI) of the Islamic Development Bank (IsDB) Group.
APA, Harvard, Vancouver, ISO, and other styles
6

Nassiri-Ansari, Tiffany, and Emma Rhule. Enabling Environments to Advance Gender Equality in Health. United Nations University - International Institute for Global Health, 2023. http://dx.doi.org/10.37941/mr/2023/1.

Full text
Abstract:
This report captures insights gleaned from a meeting convened by the United Nations University’s International Institute for Global Health (UNU-IIGH), which took place on June 20-22. Across the three days, over two dozen delegates from 17 countries came together to envision, facilitate, and support “Enabling Environments to Advance Gender Equality in Health” through the use of a futures approach. A decolonial feminist lens informed the design and delivery of the meeting, guiding interpretations of our past, analyses of our present, and visions of our futures through an explicit interrogation of the ongoing impacts of coloniality as a racialised and gendered project.
APA, Harvard, Vancouver, ISO, and other styles
7

Butler, John M. Bitemark Analysis. Gaithersburg, MD: National Institute of Standards and Technology, 2022. http://dx.doi.org/10.6028/nist.ir.8352-draft.

Full text
Abstract:
This report summarizes a review of the scientific foundations of bitemark analysis conducted by the National Institute of Standards and Technology (NIST). Bitemark analysis typically involves examining patterned injuries left on a victim or object at a crime scene, identifying those injuries as bitemarks, and comparing those marks with dental impressions from a person of interest. This review specifically focuses on pattern injuries found on human skin. Over 400 sources were considered via literature searches and input from previous efforts by the National Institute of Justice Forensic Technology Center of Excellence. Our NIST review also utilized input from an October 2019 Bitemark Thinkshop organized by the Center for Statistics and Applications in Forensic Evidence (CSAFE) where experts and stakeholders associated with bitemark analysis were convened to discuss key issues. Based on this input, our study found a lack of support for three key premises of the field: 1) human dentition is unique at the individual level, 2) this uniqueness can be accurately transferred to human skin, and 3) identifying characteristics can be accurately captured and interpreted by analysis techniques. Furthermore, our review noted a lack of consensus among practitioners on the interpretation of bitemark evidence as well as thoughts on how to move the field forward. If the field seeks to advance, the key takeaways provided in this review are starting points for areas needing improvement, not an exhaustive list of specific shortcomings.
APA, Harvard, Vancouver, ISO, and other styles
8

Abbott Galvão, Luísa. Reporting on Violence against Women: A Case Study of Select News Media in Seven Countries in Latin America and the Caribbean. Inter-American Development Bank, December 2015. http://dx.doi.org/10.18235/0007964.

Full text
Abstract:
This report outlines the results of a preliminary case study of the portrayal by the news media of violence against women in Latin America and the Caribbean. It focuses on national print news agencies in seven countries: Brazil, Colombia, El Salvador, Jamaica, Mexico, Paraguay, and Uruguay. The aim of this analysis is to identify general patterns on the way the news media conveys violence against women and highlight areas that require additional scrutiny by the news media as well as civil society, government, and the international development community.
APA, Harvard, Vancouver, ISO, and other styles
9

P. D. Mattie, J. A. McNeish, D. S. Sevougian, and R. W. Andrews. Methods and Techniques Used to Convey Total System Performance Assessment Analyses and Results for Site Recommendation at Yucca Mountain, Nevada, USA. Office of Scientific and Technical Information (OSTI), April 2001. http://dx.doi.org/10.2172/786563.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ramírez, Miguel Ángel, and Felicia Marie Knaul. Family Violence and Child Abuse in Latin America and the Caribbean: The Case of Colombia and Mexico. Inter-American Development Bank, February 2005. http://dx.doi.org/10.18235/0008959.

Full text
Abstract:
The report analyzes the impact of child abuse on children's educational outcomes and adult labor wages, using a human capital framework. It finds robust evidence of the impacts of child violence on school attendance and educational attainment in Colombia and on adult wages in Mexico City. The study also conveys the difficulty of studying the subject. Data limitations are probably behind the lack of significant findings for impacts on wages in Colombia and on education in Mexico City. Despite these difficulties, this report underscores the importance for economic and social development of better documenting family violence against children in the region.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Analyse convexe' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography