Letteratura scientifica selezionata sul tema "Analyse non convexe"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Analyse non convexe".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Articoli di riviste sul tema "Analyse non convexe"
Deguire, Paul, e Andrzej Granas. "Sur une certaine alternative non-linéaire en analyse convexe". Studia Mathematica 83, n. 2 (1986): 127–38. http://dx.doi.org/10.4064/sm-83-2-127-138.
Testo completoVolle, M. "Sur quelques formules de dualit� convexe et non convexe". Set-Valued Analysis 2, n. 1-2 (1994): 369–79. http://dx.doi.org/10.1007/bf01027112.
Testo completoNeilan, Michael, Abner J. Salgado e Wujun Zhang. "Numerical analysis of strongly nonlinear PDEs". Acta Numerica 26 (1 maggio 2017): 137–303. http://dx.doi.org/10.1017/s0962492917000071.
Testo completoGrasmair, Markus. "Non-convex sparse regularisation". Journal of Mathematical Analysis and Applications 365, n. 1 (maggio 2010): 19–28. http://dx.doi.org/10.1016/j.jmaa.2009.09.055.
Testo completoKolář, Jan. "Non-compact lamination convex hulls". Annales de l'Institut Henri Poincare (C) Non Linear Analysis 20, n. 3 (maggio 2003): 391–403. http://dx.doi.org/10.1016/s0294-1449(02)00007-0.
Testo completoAbuelela, Waleed. "Hardy inequalities for some non-convex domains". Journal of Mathematical Inequalities, n. 1 (2012): 1–14. http://dx.doi.org/10.7153/jmi-06-01.
Testo completoBachir, Mohammed. "A Non-Convex Analogue to Fenchel Duality". Journal of Functional Analysis 181, n. 2 (aprile 2001): 300–312. http://dx.doi.org/10.1006/jfan.2000.3701.
Testo completoBrezis, Haïm, e Hoai-Minh Nguyen. "Non-local, non-convex functionals converging to Sobolev norms". Nonlinear Analysis 191 (febbraio 2020): 111626. http://dx.doi.org/10.1016/j.na.2019.111626.
Testo completoChemetov, N., e M. D. P. Monteiro Marques. "Non-convex Quasi-variational Differential Inclusions". Set-Valued Analysis 15, n. 3 (27 aprile 2007): 209–21. http://dx.doi.org/10.1007/s11228-007-0045-9.
Testo completoShih, Mau-Hsiang, e Kok-Keong Tan. "Non-compact sets with convex sections, II". Journal of Mathematical Analysis and Applications 120, n. 1 (novembre 1986): 264–70. http://dx.doi.org/10.1016/0022-247x(86)90214-3.
Testo completoTesi sul tema "Analyse non convexe"
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.
Testo completoDANIILIDIS, 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.
Testo completoCadoux, 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.
Testo completoBachir, Mohammed. "Dualité, calcul sous différentiel et intégration en analyse non lisse et non convexe". Bordeaux 1, 2000. http://www.theses.fr/2000BOR10515.
Testo completoLi, Wei. "Analyse numérique de problèmes non convexes à donnée au bord non linéaire". Metz, 1993. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/1993/Li.Wei.SMZ9310.pdf.
Testo completoIn this thesis, we study a kind of non-convex varaitional problems. Such problems originated in material science, for example in crystal, etc. We consider the following problems : inf#(*(x)) dx; inf#(*(x))+((x)a(x)) dx on certain Sobolev space w#1#p(a) and where the energy density posses energy wells, say w1 i=1,. . . K. In general, such problems can be no classical solution. In our studies, the numerical method introduced by M. Chipot, C. Collins and D. Kinderlerer has been developped. In section 1 and 2 some results of estimation in a space of finit-element are obtained. Section 3 is contributed to an analysis or parametrized measure. We get a result of Young measure which showing the existence and uniqueness of the generalized solution. And in section 4, we have some estimation results in terms of probability, which explains the behavior of the minimising sequences
Zaourar, Sofia. "Optimisation convexe non-différentiable et méthodes de décomposition en recherche opérationnelle". Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM099.
Testo completoDecomposition methods are an application of the divide and conquer principle to large-scale optimization. Their idea is to decompose a given optimization problem into a sequence of easier subproblems. Although successful for many applications, these methods still present challenges. In this thesis, we propose methodological and algorithmic improvements of decomposition methods and illustrate them on several operations research problems. Our approach heavily relies on convex analysis and nonsmooth optimization. In constraint decomposition (or Lagrangian relaxation) applied to short-term electricity generation management, even the subproblems are too difficult to solve exactly. When solved approximately though, the obtained prices show an unstable noisy behaviour. We present a simple way to improve the structure of the prices by penalizing their noisy behaviour, in particular using a total variation regularization. We illustrate the consistency of our regularization on real-life problems from EDF. We then consider variable decomposition (or Benders decomposition), that can have a very slow convergence. With a nonsmooth optimization point of view on this method, we address the instability of Benders cutting-planes algorithm. We present an algorithmic stabilization inspired by bundle methods for convex optimization. The acceleration provided by this stabilization is illustrated on network design andhub location problems. We also study more general convex nonsmooth problems whose objective function is expensive to evaluate. This situation typically arises in decomposition methods. We show that it often exists extra information about the problem, cheap but with unknown accuracy, that is not used by the algorithms. We propose a way to incorporate this coarseinformation into classical nonsmooth optimization algorithms and apply it successfully to two-stage stochastic problems.Finally, we introduce a decomposition strategy for the machine reassignment problem. This decomposition leads to a new variant of vector bin packing problems, where the bins have variable sizes. We propose fast and efficient heuristics for this problem that improve on state of the art results of vector bin packing problems. An adaptation of these heuristics is also able to generate feasible solutions for Google instances of the machine reassignment problem
Le, Ba Khiet. "Stabilité des systèmes dynamiques non-réguliers et applications". Limoges, 2013. http://www.theses.fr/2013LIMO4054.
Testo completoThis manuscript deals with the stability of non-smooth dynamical systems and applications. More precisely, we aim to provide a formulation to study the stability analysis of non-smooth dynamical systems, particularly in electrical circuits and mechanics with dry friction and robustness. The efficient tools which we have used are non-smooth analysis, Lyapunov stability theorem and non-smooth mathematical frameworks : complementarity and differentials inclusions. In details, we use complementarity formalism to model some simple switch systems and differential inclusions to model a Dc-Dc Buck converter, Lagrange dynamical systems and Lur'e systems. For each model, we are interested in the well-posedness, stability properties of trajectories, even finite-time stability or putting a control force to obtain finite-time stability, and finding numerical ways to simulate the systems. The theoretical results are supported by some examples in electrical circuits and mechanics with numerical simulations. It is noted that the method used in this monograph can be applied to analyze for non-smooth dynamical systems from other fields such as economics, finance or biology. .
Nacry, Florent. "Processus d’évolution discontinus de Moreau et stabilité de la prox-régularité : Applications à l’optimisation non-convexe et aux équations généralisée". Thesis, Limoges, 2017. http://www.theses.fr/2017LIMO0022.
Testo completoIn this dissertation, we study, on the one hand, the existence of solutions for some evolution problems and, on the other hand, the stability of prox-regularity under set operations. The first topic is devoted to first and second order nonconvex perturberd Moreau's sweeping processes in infinite dimensional framework. The moving set is assumed to be prox-regular and moved in a bounded variation way. Applications to the theory of complementarity problems and evolution variational inequalities are given. In the other topic, we first give verifiable sufficient conditions ensuring the prox-regularity of constrained sets and more generally for solution sets of generalized equations. We also develop the preservation of prox-regularity under set operations as intersection, direct image, inverse image, union and projection along a vector space
Ta, Minh Thuy. "Techniques d'optimisation non convexe basée sur la programmation DC et DCA et méthodes évolutives pour la classification non supervisée". Thesis, Université de Lorraine, 2014. http://www.theses.fr/2014LORR0099/document.
Testo completoThis thesis focus on four problems in data mining and machine learning: clustering data streams, clustering massive data sets, weighted hard and fuzzy clustering and finally the clustering without a prior knowledge of the clusters number. Our methods are based on deterministic optimization approaches, namely the DC (Difference of Convex functions) programming and DCA (Difference of Convex Algorithm) for solving some classes of clustering problems cited before. Our methods are also, based on elitist evolutionary approaches. We adapt the clustering algorithm DCA–MSSC to deal with data streams using two windows models: sub–windows and sliding windows. For the problem of clustering massive data sets, we propose to use the DCA algorithm with two phases. In the first phase, massive data is divided into several subsets, on which the algorithm DCA–MSSC performs clustering. In the second phase, we propose a DCA–Weight algorithm to perform a weighted clustering on the obtained centers in the first phase. For the weighted clustering, we also propose two approaches: weighted hard clustering and weighted fuzzy clustering. We test our approach on image segmentation application. The final issue addressed in this thesis is the clustering without a prior knowledge of the clusters number. We propose an elitist evolutionary approach, where we apply several evolutionary algorithms (EAs) at the same time, to find the optimal combination of initial clusters seed and in the same time the optimal clusters number. The various tests performed on several sets of large data are very promising and demonstrate the effectiveness of the proposed approaches
Alaa, Nour Eddine. "Étude d'équations elliptiques non linéaires à dépendance convexe en le gradient et à données mesures". Nancy 1, 1989. http://www.theses.fr/1989NAN10460.
Testo completoLibri sul tema "Analyse non convexe"
Hendricus, Schikhof Wilhelmus, a cura di. Locally convex spaces over non-Archimedean valued fields. Cambridge, UK: Cambridge University Press, 2010.
Cerca il testo completoPerez-Garcia, C. Locally convex spaces over non-Archimedean valued fields. New York: Cambridge University Press, 2009.
Cerca il testo completoFoundations of complex analysis in non locally convex spaces: Function theory without convexity condition. Amsterdam: Elsevier, 2003.
Cerca il testo completoLiana, Lupșa, a cura di. Non-connected convexities and applications. Dordrecht: Kluwer Academic Publishers, 2002.
Cerca il testo completoLombardo, Luca. Albertino Mussato, Epistole metriche Edizione critica, traduzione e commento. Venice: Fondazione Università Ca’ Foscari, 2020. http://dx.doi.org/10.30687/978-88-6969-436-3.
Testo completoChambers, Robert G. Competitive Agents in Certain and Uncertain Markets. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190063016.001.0001.
Testo completoCristescu, G., e L. Lupsa. Non-Connected Convexities and Applications. Springer, 2014.
Cerca il testo completoCristescu, G., e L. Lupsa. Non-Connected Convexities and Applications (Applied Optimization). Springer, 2002.
Cerca il testo completoEpstein, Charles L., e Rafe Mazzeo. Wright-Fisher Geometry. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691157122.003.0002.
Testo completoMathews, Debra J. H. When emerging biomedical technologies converge or collide. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198786832.003.0001.
Testo completoCapitoli di libri sul tema "Analyse non convexe"
Joro, Tarja, e Pekka J. Korhonen. "Non-convex Value Efficiency Analysis". In International Series in Operations Research & Management Science, 147–59. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4899-7528-7_10.
Testo completoRémon, M. "Convex Discriminant Analysis Tools for Non Convex Pattern Recognition". In Studies in Classification, Data Analysis, and Knowledge Organization, 159–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-55991-4_17.
Testo completoAmyari, Maryam, e Ghadir Sadeghi. "Isometrics in Non-Archimedean Strictly Convex and Strictly 2-Convex 2-Normed Spaces". In Nonlinear Analysis and Variational Problems, 13–22. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-1-4419-0158-3_2.
Testo completoBakelman, Ilya J. "Non-Compact Problems for Elliptic Solutions of Monge-Ampere Equations". In Convex Analysis and Nonlinear Geometric Elliptic Equations, 204–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-69881-1_5.
Testo completoGroße, Andree, Kai Rothaus e Xiaoyi Jiang. "Detection of Non-convex Objects by Dynamic Programming". In Computer Analysis of Images and Patterns, 285–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03767-2_35.
Testo completoBakelman, Ilya J. "The Geometric Maximum Principle for General Non-Divergent Quasilinear Elliptic Equations". In Convex Analysis and Nonlinear Geometric Elliptic Equations, 339–495. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-69881-1_8.
Testo completoRémon, Marcel. "Discriminant Analysis Tools for Non Convex Pattern Recognition". In Studies in Classification, Data Analysis, and Knowledge Organization, 241–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-59789-3_39.
Testo completoMajumdar, Angshul, e Rabab K. Ward. "Under-Determined Non-cartesian MR Reconstruction with Non-convex Sparsity Promoting Analysis Prior". In Medical Image Computing and Computer-Assisted Intervention – MICCAI 2010, 513–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15711-0_64.
Testo completoKitić, Srđan, Nancy Bertin e Rémi Gribonval. "Sparsity and Cosparsity for Audio Declipping: A Flexible Non-convex Approach". In Latent Variable Analysis and Signal Separation, 243–50. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22482-4_28.
Testo completoTone, Kaoru, e Miki Tsutsui. "HOW TO DEAL WITH NON-CONVEX FRONTIERS IN DATA ENVELOPMENT ANALYSIS". In Advances in DEA Theory and Applications, 271–99. Chichester, UK: John Wiley & Sons, Ltd, 2017. http://dx.doi.org/10.1002/9781118946688.ch20.
Testo completoAtti di convegni sul tema "Analyse non convexe"
Xu, Yi, Zhuoning Yuan, Sen Yang, Rong Jin e Tianbao Yang. "On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Minimization". In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/556.
Testo completoZhang, Hu, Pan Zhou, Yi Yang e Jiashi Feng. "Generalized Majorization-Minimization for Non-Convex Optimization". In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/591.
Testo completoISHIWATA, TETSUYA. "MOTION OF NON-CONVEX POLYGON BY CRYSTALLINE CURVATURE FLOW AND ITS GENERALIZATION". In Proceedings of the International Conference on Nonlinear Analysis. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812709257_0008.
Testo completoMattsen, Sven, Arne Wichmann e Sibylle Schupp. "A non-convex abstract domain for the value analysis of binaries". In 2015 IEEE 22nd International Conference on Software Analysis, Evolution and Reengineering (SANER). IEEE, 2015. http://dx.doi.org/10.1109/saner.2015.7081837.
Testo completoBlanchet, Jose, Christopher Dolan e Henry Lam. "Robust rare-event performance analysis with natural non-convex constraints". In 2014 Winter Simulation Conference - (WSC 2014). IEEE, 2014. http://dx.doi.org/10.1109/wsc.2014.7019924.
Testo completoDing, Hua, Ninggang Shen, Keqin Li, Wu Bo, Chelsey N. Pence e 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.
Testo completoLópez, J., P. Gómez, C. Zanzi, F. Faura e J. Hernández. "Application of Non-Convex Analytic and Geometric Tools to a PLIC-VOF Method". In ASME 2016 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/imece2016-67409.
Testo completoRukavishnikov, Viktor A., e Alexey V. Rukavishnikov. "New numerical approach for solving the oseen problem in a convection form in non-convex domain". In INTERNATIONAL CONFERENCE ON ANALYSIS AND APPLIED MATHEMATICS (ICAAM 2020). AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0040324.
Testo completoChan, Tsung-Han, Wing-Kin Ma, Chong-Yung Chi e Yue Wang. "A Convex Analysis Based Criterion for Blind Separation of Non-Negative Sources". In 2007 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE, 2007. http://dx.doi.org/10.1109/icassp.2007.366841.
Testo completoAlthoff, Matthias. "Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets". In the 16th international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2461328.2461358.
Testo completoRapporti di organizzazioni sul tema "Analyse non convexe"
Hellström, Anders. How anti-immigration views were articulated in Sweden during and after 2015. Malmö University, Malmö Institute for Studies of Migration, Diversity and Welfare (MIM), 2021. http://dx.doi.org/10.24834/isbn.9789178771936.
Testo completoRincón-Torres, Andrey Duván, Kimberly Rojas-Silva e Juan Manuel Julio-Román. The Interdependence of FX and Treasury Bonds Markets: The Case of Colombia. Banco de la República, settembre 2021. http://dx.doi.org/10.32468/be.1171.
Testo completoYatsymirska, Mariya. SOCIAL EXPRESSION IN MULTIMEDIA TEXTS. Ivan Franko National University of Lviv, febbraio 2021. http://dx.doi.org/10.30970/vjo.2021.49.11072.
Testo completo