Literatura científica selecionada sobre o tema "Non-smooth optimisation"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Non-smooth optimisation".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Non-smooth optimisation"
Dao, Minh Ngoc, Dominikus Noll e Pierre Apkarian. "Robust eigenstructure clustering by non-smooth optimisation". International Journal of Control 88, n.º 8 (3 de março de 2015): 1441–55. http://dx.doi.org/10.1080/00207179.2015.1007393.
Texto completo da fonteYao, Zhiqiang, Jinfeng Huang, Shiguo Wang e Rukhsana Ruby. "Efficient local optimisation‐based approach for non‐convex and non‐smooth source localisation problems". IET Radar, Sonar & Navigation 11, n.º 7 (julho de 2017): 1051–54. http://dx.doi.org/10.1049/iet-rsn.2016.0433.
Texto completo da fontePothiya, Saravuth, Issarachai Ngamroo e Waree Kongprawechnon. "Ant colony optimisation for economic dispatch problem with non-smooth cost functions". International Journal of Electrical Power & Energy Systems 32, n.º 5 (junho de 2010): 478–87. http://dx.doi.org/10.1016/j.ijepes.2009.09.016.
Texto completo da fonteSach, Pham Huu, Gue Myung Lee e Do Sang Kim. "Efficiency and generalised convexity in vector optimisation problems". ANZIAM Journal 45, n.º 4 (abril de 2004): 523–46. http://dx.doi.org/10.1017/s1446181100013547.
Texto completo da fontePecci, Filippo, Edo Abraham e Ivan Stoianov. "Quadratic head loss approximations for optimisation problems in water supply networks". Journal of Hydroinformatics 19, n.º 4 (17 de abril de 2017): 493–506. http://dx.doi.org/10.2166/hydro.2017.080.
Texto completo da fonteZhu, Yuteng. "Designing a physically-feasible colour filter to make a camera more colorimetric". London Imaging Meeting 2020, n.º 1 (29 de setembro de 2020): 96–99. http://dx.doi.org/10.2352/issn.2694-118x.2020.lim-16.
Texto completo da fonteWang, Wei-Xiang, You-Lin Shang e Ying Zhang. "Finding global minima with a novel filled function for non-smooth unconstrained optimisation". International Journal of Systems Science 43, n.º 4 (abril de 2012): 707–14. http://dx.doi.org/10.1080/00207721.2010.520094.
Texto completo da fonteChen, Shuming, Zhenyu Zhou e Jixiu Zhang. "Multi-objective optimisation of automobile sound package with non-smooth surface based on grey theory and particle swarm optimisation". International Journal of Vehicle Design 88, n.º 2/3/4 (2022): 238. http://dx.doi.org/10.1504/ijvd.2022.127018.
Texto completo da fonteChen, Shuming, Jixiu Zhang e Zhenyu Zhou. "Multi-objective optimisation of automobile sound package with non-smooth surface based on grey theory and particle swarm optimisation". International Journal of Vehicle Design 88, n.º 2/3/4 (2022): 238. http://dx.doi.org/10.1504/ijvd.2022.10052010.
Texto completo da fonteRibeiro, Tiago, Yun-Fei Fu, Luís Bernardo e Bernard Rolfe. "Topology Optimisation of Structural Steel with Non-Penalisation SEMDOT: Optimisation, Physical Nonlinear Analysis, and Benchmarking". Applied Sciences 13, n.º 20 (17 de outubro de 2023): 11370. http://dx.doi.org/10.3390/app132011370.
Texto completo da fonteTeses / dissertações sobre o assunto "Non-smooth optimisation"
Hess, Roxana. "Some approximation schemes in polynomial optimization". Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30129/document.
Texto completo da fonteThis thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semidefinite programming problems in polynomial optimization, commonly called the Lasserre hierarchy. We examine different aspects of its properties and purposes. As applications of the hierarchy, we approximate some potentially complicated objects, namely the polynomial abscissa and optimal designs on semialgebraic domains. Applying the Lasserre hierarchy results in approximations by polynomials of fixed degree and hence bounded complexity. With regard to the complexity of the hierarchy itself, we construct a modification of it for which an improved convergence rate can be proved. An essential concept of the hierarchy is to use quadratic modules and their duals as a tractable characterization of the cone of positive polynomials and the moment cone, respectively. We exploit further this idea to construct tight approximations of semialgebraic sets with polynomial separators
Svensson, Anton. "Non-smooth and variational analysis of optimization problems and multi-leader-follower games". Thesis, Perpignan, 2020. http://www.theses.fr/2020PERP0003.
Texto completo da fonteThis thesis is within the framework of optimization and deals with nonsmooth optimization and with some problems of game theory. It is divided into four parts. In the first introductory part, we give the context and some preliminary results. In the second part we discuss about subdifferential calculus rules in general spaces providing of some improved formulas in both the convex and the non-convex cases. Here the focus is on approximate or fuzzy calculus rules and optimality conditions, for which no qualification conditions are required. In the third part, we discuss about the so-called Multi-Leader-Follower Games. We give an existence result for the case of a single optimistic leader and multiple followers, and extend some results concerning the relation between the original problem with the reformulation obtained by replacing the followers' problem by the concatenation of their KKT conditions. Finally, in the fourth part we study quasi-equilibrium problems which are a general formulation for studying Nash equilibrium problems and quasi-variational inequalities. We provide some new existence results that relax some of the standard hypotheses
Jacob, de Cordemoy Aymeric. "Analyse de sensibilité et optimisation pour des problèmes de contact". Electronic Thesis or Diss., Pau, 2023. http://www.theses.fr/2023PAUU3038.
Texto completo da fonteSensitivity analysis of problems described by variational inequalities is a promising field for the treatment of optimal control and shape optimization problems in contact mechanics. The objective of this PhD thesis is to carry out such analysis without using classical regularization and/or penalization procedures which perturb the non-smooth nature of the original physical models. Then we propose a new methodology, based on advanced tools from convex and non-smooth analyses, such as the proximal operator and the concept of second order epi-differentiability. More precisely, the models considered are those from contact mechanics, describing the contact between a deformable body with a rigid foundation without penetrating it, and possibly allows sliding modes which causes friction phenomena. The non-permeability condition can be described by the Signorini unilateral conditions, while the friction can be described by the Tresca friction law, both resulting in inequalities and/or non-smooth terms in the corresponding variational formulations. Using our approach, we perform a sensitivity analysis of these models and thus study associated optimal control and shape optimization problems
Lazzaretti, Marta. "Algorithmes d'optimisation dans des espaces de Banach non standard pour problèmes inverses en imagerie". Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ4009.
Texto completo da fonteThis thesis focuses on the modelling, the theoretical analysis and the numerical implementation of advanced optimisation algorithms for imaging inverse problems (e.g,., image reconstruction in computed tomography, image deconvolution in microscopy imaging) in non-standard Banach spaces. It is divided into two parts: in the former, the setting of Lebesgue spaces with a variable exponent map L^{p(cdot)} is considered to improve adaptivity of the solution with respect to standard Hilbert reconstructions; in the latter a modelling in the space of Radon measures is used to avoid the biases observed in sparse regularisation methods due to discretisation.In more detail, the first part explores both smooth and non-smooth optimisation algorithms in reflexive L^{p(cdot)} spaces, which are Banach spaces endowed with the so-called Luxemburg norm. As a first result, we provide an expression of the duality maps in those spaces, which are an essential ingredient for the design of effective iterative algorithms.To overcome the non-separability of the underlying norm and the consequent heavy computation times, we then study the class of modular functionals which directly extend the (non-homogeneous) p-power of L^p-norms to the general L^{p(cdot)}. In terms of the modular functions, we formulate handy analogues of duality maps, which are amenable for both smooth and non-smooth optimisation algorithms due to their separability. We thus study modular-based gradient descent (both in deterministic and in a stochastic setting) and modular-based proximal gradient algorithms in L^{p(cdot)}, and prove their convergence in function values. The spatial flexibility of such spaces proves to be particularly advantageous in addressing sparsity, edge-preserving and heterogeneous signal/noise statistics, while remaining efficient and stable from an optimisation perspective. We numerically validate this extensively on 1D/2D exemplar inverse problems (deconvolution, mixed denoising, CT reconstruction). The second part of the thesis focuses on off-the-grid Poisson inverse problems formulated within the space of Radon measures. Our contribution consists in the modelling of a variational model which couples a Kullback-Leibler data term with the Total Variation regularisation of the desired measure (that is, a weighted sum of Diracs) together with a non-negativity constraint. A detailed study of the optimality conditions and of the corresponding dual problem is carried out and an improved version of the Sliding Franke-Wolfe algorithm is used for computing the numerical solution efficiently. To mitigate the dependence of the results on the choice of the regularisation parameter, an homotopy strategy is proposed for its automatic tuning, where, at each algorithmic iteration checks whether an informed stopping criterion defined in terms of the noise level is verified and update the regularisation parameter accordingly. Several numerical experiments are reported on both simulated 2D and real 3D fluorescence microscopy data
Pierre, Fabien. "Méthodes variationnelles pour la colorisation d’images, de vidéos, et la correction des couleurs". Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0250/document.
Texto completo da fonteThis thesis deals with problems related to color. In particular, we are interested inproblems which arise in image and video colorization and contrast enhancement. When considering color images composed of two complementary information, oneachromatic (without color) and the other chromatic (in color), the applications studied in this thesis are based on the processing one of these information while preserving its complement. In colorization, the challenge is to compute a color image while constraining its gray-scale channel. Contrast enhancement aims to modify the intensity channel of an image while preserving its hue.These joined problems require to formally study the RGB space geometry. In this work, it has been shown that the classical color spaces of the literature designed to solve these classes of problems lead to errors. An novel algorithm, called luminance-hue specification, which computes a color with a given hue and luminance is described in this thesis. The extension of this method to a variational framework has been proposed. This model has been used successfully to enhance color images, using well-known assumptions about the human visual system. The state-of-the-art methods for image colorization fall into two categories. The first category includes those that diffuse color scribbles drawn by the user (manual colorization). The second consists of those that benefits from a reference color image or a base of reference images to transfer the colors from the reference to the grayscale image (exemplar-based colorization). Both approach have their advantages and drawbacks. In this thesis, we design a variational model for exemplar-based colorization which is extended to a method unifying the manual colorization and the exemplar-based one. Finally, we describe two variational models to colorize videos in interaction with the user
Gabarrou, Marion. "Développement d’un algorithme de faisceau non convexe avec contrôle de proximité pour l’optimisation de lois de commande structurées". Thesis, Toulouse, ISAE, 2012. http://www.theses.fr/2012ESAE0030/document.
Texto completo da fonteThis thesis develops a non convex bundle method for the minimization of lower C1 locally Lipschitz functions which it then applies to the synthesis of structured control laws for problems arising in aerospace control. Here a structured control law refers to a control architecture preferred by practitioners, which consist of elements like PIDs, combined with various filters, featuring significantly less tunable parameters than a full-order controller. This type of problem can be formulated under the theoretical and general framework of non convex and non smooth programming. Among the efficient numerical techniques to solve such non smooth problems, we have in this work opted for bundle methods, suitably extended to address non-convex optimization programs. Bundle methods use oracles which at every iterate x return the function value and one unspecified Clarke subgradient. In order to generate descent steps away from a current serious iterate, these techniques hinge on storing and accumulating information, called the bundle, obtained from successive evaluations of the oracle along the unsuccessful trial steps. In this thesis, we propose to build the bundle by shifting down a tangent of the objective at a trial step which is not a satisfactory descent step. The shift is essential in the non convex case in order to preserve the consistency, named also the exactitude, of the model with regard to the objective. The developed algorithm is validated on a synthesis problem combining the automatic pilot and the flight control law of a civil aircraft at a given flying point ; and a gain scheduled control law synthesis for the longitudinal control in a flight envelope
Hoang, Thi Minh Phuong. "Optimisation des temps de calculs dans le domaine de la simulation par éléments discrets pour des applications ferroviaires". Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2011. http://tel.archives-ouvertes.fr/tel-00726199.
Texto completo da fonteZheng, Yuling. "Algorithmes bayésiens variationnels accélérés et applications aux problèmes inverses de grande taille". Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112354/document.
Texto completo da fonteIn this thesis, our main objective is to develop efficient unsupervised approaches for large dimensional problems. To do this, we consider Bayesian approaches, which allow us to jointly estimate regularization parameters and the object of interest. In this context, the main difficulty is that the posterior distribution is generally complex. To tackle this problem, we consider variational Bayesian (VB) approximation, which provides a separable approximation of the posterior distribution. Nevertheless, classical VB methods suffer from slow convergence speed. The first contribution of this thesis is to transpose the subspace optimization methods to the functional space involved in VB framework, which allows us to propose a new VB approximation method. We have shown the efficiency of the proposed method by comparisons with the state of the art approaches. Then we consider the application of our new methodology to large dimensional problems in image processing. Moreover, we are interested in piecewise smooth images. As a result, we have considered a Total Variation (TV) prior and a Gaussian location mixture-like hidden variable model. With these two priors, using our VB approximation method, we have developed two fast unsupervised approaches well adapted to piecewise smooth images.In fact, the priors introduced above are correlated which makes the estimation of regularization parameters very complicated: we often have a non-explicit partition function. To sidestep this problem, we have considered working in the wavelet domain. As the wavelet coefficients of natural images are generally sparse, we considered prior distributions of the Gaussian scale mixture family to enforce sparsity. Another contribution is therefore the development of an unsupervised approach for a prior distribution of the GSM family whose density is explicitly known, using the proposed VB approximation method
Capítulos de livros sobre o assunto "Non-smooth optimisation"
Zeng, Tongyan, Essam F. Abo-Serie, Manus Henry e James Jewkes. "Thermal Optimisation Model for Cooling Channel Design Using the Adjoint Method in 3D Printed Aluminium Die-Casting Tools". In Springer Proceedings in Energy, 333–40. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30960-1_31.
Texto completo da fonteBorwein, Jonathan M., e Warren B. Moors. "Non-smooth analysis, optimisation theory and Banach space theory". In Open Problems in Topology II, 549–59. Elsevier, 2007. http://dx.doi.org/10.1016/b978-044452208-5/50050-8.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Non-smooth optimisation"
Duckitt, Sam, Chiara Bisagni e Shahrokh Shahpar. "Parametric Bird Strike Study of a Transonic Rotor Using Isogeometric Analysis". In ASME Turbo Expo 2016: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/gt2016-57464.
Texto completo da fonteStraccia, Mattia, e Volker Gümmer. "Coupling of Endwall and Aerofoil Optimisation on a Low-Speed Compressor Tandem Stator". In ASME Turbo Expo 2021: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/gt2021-59058.
Texto completo da fonteNeely, Andrew J., Peter T. Ireland e Les R. Harper. "Heat Transfer Coefficient Distributions for the Convective Cooling of Non-Cylindrical Geometries in Crossflow Using Extended Surfaces". In ASME 1997 International Gas Turbine and Aeroengine Congress and Exhibition. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/97-gt-379.
Texto completo da fonteGro¨nstedt, Tomas, e Markus Wallin. "A Comparative Study of Genetic Algorithms and Gradient Methods for RM12 Turbofan Engine Diagnostics and Performance Estimation". In ASME Turbo Expo 2004: Power for Land, Sea, and Air. ASMEDC, 2004. http://dx.doi.org/10.1115/gt2004-53591.
Texto completo da fonteLiu, Yiyan, Sinan Acikgoz e Harvey Burd. "Terrestrial Laser Scanning based deformation monitoring for masonry buildings subjected to ground movements induced by underground construction". In 5th Joint International Symposium on Deformation Monitoring. Valencia: Editorial de la Universitat Politècnica de València, 2022. http://dx.doi.org/10.4995/jisdm2022.2022.13872.
Texto completo da fonte