Bibliographies thématiques / Cardinality constrained optimization

Littérature scientifique sur le sujet « Cardinality constrained optimization »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Cardinality constrained optimization ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Cardinality constrained optimization"

1

Kanzow, Christian, Andreas B. Raharja et Alexandra Schwartz. « An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems ». Journal of Optimization Theory and Applications 189, no 3 (29 avril 2021) : 793–813. http://dx.doi.org/10.1007/s10957-021-01854-7.

Texte intégral
Résumé :
AbstractA reformulation of cardinality-constrained optimization problems into continuous nonlinear optimization problems with an orthogonality-type constraint has gained some popularity during the last few years. Due to the special structure of the constraints, the reformulation violates many standard assumptions and therefore is often solved using specialized algorithms. In contrast to this, we investigate the viability of using a standard safeguarded multiplier penalty method without any problem-tailored modifications to solve the reformulated problem. We prove global convergence towards an (essentially strongly) stationary point under a suitable problem-tailored quasinormality constraint qualification. Numerical experiments illustrating the performance of the method in comparison to regularization-based approaches are provided.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Bertsimas, Dimitris, et Romy Shioda. « Algorithm for cardinality-constrained quadratic optimization ». Computational Optimization and Applications 43, no 1 (15 novembre 2007) : 1–22. http://dx.doi.org/10.1007/s10589-007-9126-9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Kanzow, Christian, Andreas B. Raharja et Alexandra Schwartz. « Sequential optimality conditions for cardinality-constrained optimization problems with applications ». Computational Optimization and Applications 80, no 1 (22 juillet 2021) : 185–211. http://dx.doi.org/10.1007/s10589-021-00298-z.

Texte intégral
Résumé :
AbstractRecently, a new approach to tackle cardinality-constrained optimization problems based on a continuous reformulation of the problem was proposed. Following this approach, we derive a problem-tailored sequential optimality condition, which is satisfied at every local minimizer without requiring any constraint qualification. We relate this condition to an existing M-type stationary concept by introducing a weak sequential constraint qualification based on a cone-continuity property. Finally, we present two algorithmic applications: We improve existing results for a known regularization method by proving that it generates limit points satisfying the aforementioned optimality conditions even if the subproblems are only solved inexactly. And we show that, under a suitable Kurdyka–Łojasiewicz-type assumption, any limit point of a standard (safeguarded) multiplier penalty method applied directly to the reformulated problem also satisfies the optimality condition. These results are stronger than corresponding ones known for the related class of mathematical programs with complementarity constraints.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Stephan, Rüdiger. « Cardinality constrained combinatorial optimization : Complexity and polyhedra ». Discrete Optimization 7, no 3 (août 2010) : 99–113. http://dx.doi.org/10.1016/j.disopt.2010.03.002.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Cai, L. « Parameterized Complexity of Cardinality Constrained Optimization Problems ». Computer Journal 51, no 1 (6 mars 2007) : 102–21. http://dx.doi.org/10.1093/comjnl/bxm086.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Bacanin, Nebojsa, et Milan Tuba. « Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint ». Scientific World Journal 2014 (2014) : 1–16. http://dx.doi.org/10.1155/2014/721521.

Texte intégral
Résumé :
Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Xu, Fengmin, Yuhong Dai, Zhihu Zhao et Zongben Xu. « Efficient projected gradient methods for cardinality constrained optimization ». Science China Mathematics 62, no 2 (25 avril 2018) : 245–68. http://dx.doi.org/10.1007/s11425-016-9124-0.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Sadjadi, Seyed Jafar, Mohsen Gharakhani et Ehram Safari. « Robust optimization framework for cardinality constrained portfolio problem ». Applied Soft Computing 12, no 1 (janvier 2012) : 91–99. http://dx.doi.org/10.1016/j.asoc.2011.09.006.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Shaw, Dong X., Shucheng Liu et Leonid Kopman. « Lagrangian relaxation procedure for cardinality-constrained portfolio optimization ». Optimization Methods and Software 23, no 3 (juin 2008) : 411–20. http://dx.doi.org/10.1080/10556780701722542.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Febrianti, Werry, Kuntjoro Adji Sidarto et Novriana Sumarti. « Solving Constrained Mean-Variance Portfolio Optimization Problems Using Spiral Optimization Algorithm ». International Journal of Financial Studies 11, no 1 (20 décembre 2022) : 1. http://dx.doi.org/10.3390/ijfs11010001.

Texte intégral
Résumé :
Portfolio optimization is an activity for balancing return and risk. In this paper, we used mean-variance (M-V) portfolio models with buy-in threshold and cardinality constraints. This model can be formulated as a mixed integer nonlinear programming (MINLP) problem. To solve this constrained mean-variance portfolio optimization problem, we propose the use of a modified spiral optimization algorithm (SOA). Then, we use Bartholomew-Biggs and Kane’s data to validate our proposed algorithm. The results show that our proposed algorithm can be an efficient tool for solving this portfolio optimization problem.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Cardinality constrained optimization"

1

Aslan, Murat. « The Cardinality Constrained Multiple Knapsack Problem ». Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12610131/index.pdf.

Texte intégral
Résumé :
The classical multiple knapsack problem selects a set of items and assigns each to one of the knapsacks so as to maximize the total profit. The knapsacks have limited capacities. The cardinality constrained multiple knapsack problem assumes limits on the number of items that are to be put in each knapsack, as well. Despite many efforts on the classical multiple knapsack problem, the research on the cardinality constrained multiple knapsack problem is scarce. In this study we consider the cardinality constrained multiple knapsack problem. We propose heuristic and optimization procedures that rely on the optimal solutions of the linear programming relaxation problem. Our computational results on the large-sized problem instances have shown the satisfactory performances of our algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Li, Yibo. « Solving cardinality constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation ». Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/10867.

Texte intégral
Résumé :
In this thesis we consider solution approaches for the index tacking problem, in which we aim to reproduces the performance of a market index without purchasing all of the stocks that constitute the index. We solve the problem using three different solution approaches: Mixed Integer Programming (MIP), Genetic Algorithms (GAs), and Ant-colony Optimization (ACO) Algorithm by limiting the number of stocks that can be held. Each index is also assigned with different cardinalities to examine the change to the solution values. All of the solution approaches are tested by considering eight market indices. The smallest data set only consists of 31 stocks whereas the largest data set includes over 2000 stocks. The computational results from the MIP are used as the benchmark to measure the performance of the other solution approaches. The Computational results are presented for different solution approaches and conclusions are given. Finally, we implement post analysis and investigate the best tracking portfolios achieved from the three solution approaches. We summarise the findings of the investigation, and in turn, we further improve some of the algorithms. As the formulations of these problems are mixed-integer linear programs, we use the solver ‘Cplex’ to solve the problems. All of the programming is coded in AMPL.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Bucher, Max [Verfasser], Alexandra [Akademischer Betreuer] Schwartz et Christian [Akademischer Betreuer] Kanzow. « Optimality Conditions and Numerical Methods for a Continuous Reformulation of Cardinality Constrained Optimization Problems / Max Bucher ; Alexandra Schwartz, Christian Kanzow ». Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2018. http://d-nb.info/1167926323/34.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Kreber, Dennis [Verfasser], Sven de [Akademischer Betreuer] Vries, Jan Pablo [Akademischer Betreuer] Burgard, Sven de [Gutachter] Vries, Jan Pablo [Gutachter] Burgard et Christoph [Gutachter] Buchheim. « Cardinality-Constrained Discrete Optimization for Regression / Dennis Kreber ; Gutachter : Sven de Vries, Jan Pablo Burgard, Christoph Buchheim ; Sven de Vries, Jan Pablo Burgard ». Trier : Universität Trier, 2019. http://d-nb.info/1197809198/34.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Dias, Carlos Henrique. « Um novo algoritmo genetico para a otimização de carteiras de investimento com restrições de cardinalidade ». [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307124.

Texte intégral
Résumé :
Orientador: Francisco de Assis Magalhães Gomes Neto
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-10T22:50:20Z (GMT). No. of bitstreams: 1 Dias_CarlosHenrique_M.pdf: 2721795 bytes, checksum: 57d6019ecabf33034889a64675ccf707 (MD5) Previous issue date: 2008
Resumo: Este trabalho tem por finalidade a determinação da fronteira eficiente de investimento através da otimização do modelo de média-variância com restrições de cardinalidade e limite inferior de investimento. Por tratar-se de um problema inteiro e não linear, cuja solução exata é de difícil obtenção, optamos por empregar um algoritmo genético, na linha desenvolvida por Chang et al. [3], que até hoje serve como referência para a determinação da fronteira eficiente de Pareto para problemas de otimização de investimentos. Entretanto, verificamos que o algoritmo proposto por Chang et al. apresenta uma distribuição não uniforme na geração de soluções aleatórias. Para contornar esse problema, introduzimos um novo esquema de geração de cromossomos, baseado na discretização do espaço, que permite a geração de soluções que satisfazem diretamente a restrição de montante total aplicado. Com essa nova abordagem, foi possível definir operadores de seleção, crossover e mutação bastante eficientes. Os resultados obtidos mostram que o novo algoritmo é mais robusto que aquele proposto por Chang et al
Abstract: In this work we consider the problem of determining of the efficient frontier of a portfolio using the mean-variance model subject to a cardinality constrain and to lower bounds on the amount invested in the selected assets. As this nonlinear integer programming problem is hard to solve exactly, we use a genetic algorithm, following the lines described by Chang et al. [3], still considered as a reference in the field. However, as the feasible solutions generated by the algorithm of Chang et al. are not uniformly distributed over the solution set, we introduce a new scheme for defining the chromosomes, based on the discretization of the feasible region, so that the amount invested always sum up to one for every solution obtained by the algorithm. This new approach allows us to define very efficient selection, crossover and mutation procedures. The numerical results obtained so far show that the new method is more robust than the one proposed by Chang et al
Mestrado
Otimização
Mestre em Matemática Aplicada
Styles APA, Harvard, Vancouver, ISO, etc.
6

Villela, Pedro Ferraz 1982. « Um algoritmo exato para a otimização de carteiras de investimento com restrições de cardinalidade ». [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307123.

Texte intégral
Résumé :
Orientador: Francisco de Assis Magalhães Gomes Neto
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-12T16:09:04Z (GMT). No. of bitstreams: 1 Villela_PedroFerraz_M.pdf: 727069 bytes, checksum: d87d64ae49bfc1a53017a463cf10b453 (MD5) Previous issue date: 2008
Resumo: Neste trabalho, propomos um método exato para a resolução de problemas de programação quadrática que envolvem restrições de cardinalidade. Como aplicação, empregamos o método para a obtenção da fronteira eficiente de um problema (bi-objetivo) de otimização de carteiras de investimento. Nosso algoritmo é baseado no método Branch-and-Bound. A chave de seu sucesso, entretanto, reside no uso do método de Lemke, que é aplicado para a resolução dos subproblemas associados aos nós da árvore gerada pelo Branch-and-Bound. Ao longo do texto, algumas heurísticas também são introduzidas, com o propósito de acelerar a convergência do método. Os resultados computacionais obtidos comprovam que o algoritmo proposto é eficiente.
Abstract: In this work, we propose an exact method for the resolution of quadratic programming problems involving cardinality restrictions. As an application, the algorithm is used to generate the effective Pareto frontier of a (bi-objective) portfolio optimization problem. This algorithm is based on the Branch-and-Bound method. The key to its success, however, resides in the application of Lemke's method to the resolution of the subproblems associated to the nodes of the tree generated by the Branch-and-Bound algorithm. Throughout the text, some heuristics are also introduced as a way to accelerate the performance of the method. The computational results acquired show that the proposed algorithm is efficient.
Mestrado
Otimização
Mestre em Matemática Aplicada
Styles APA, Harvard, Vancouver, ISO, etc.
7

« On cardinality constrained optimization ». Thesis, 2009. http://library.cuhk.edu.hk/record=b6074943.

Texte intégral
Résumé :
Although cardinality constraints naturally arise in many applications, e.g., in portfolio selection problems of choosing small number of assets from a large pool of stocks or dynamic portfolio selection problems with limited trading dates within a given time horizon and in subset selection of the regression analysis, the state-of-the-art in cardinality constrained optimization has been stagnant up to this stage, largely due to the inherent combinatorial nature of such hard problems. We focus in this research on developing efficient and implementable solution algorithms for cardinality constrained optimization by investigating prominent structures and hidden properties of such problems. More specifically, we develop solution algorithms for four specific cardinality constrained optimization problems, including (i) the cardinality constrained linear-quadratic control problem, (ii) the optimal control problem of linear switched system with limited number of switching, (iii) the time cardinality constrained dynamic mean- variance portfolio selection problem, and (iv) cardinality constrained quadratic optimization problem. Taking advantages of a linear-quadratic structure of cardinality constrained optimization problems, we strive for analytical solutions when possible. More specifically, we derive an analytical solution for problem (iii) and obtain for both problems (i) and (ii) semi-analytical expressions of the solution governed by a family of Ricatti-like equations, which still suffer an exponentially growing complexity. To achieve high-performance of the solution algorithm, we devise algorithms of a branch and bound (BnB) type with various tight and computationally-cheap lower bounds achieved by identifying suitable SDP formulations and by exploiting geometric properties of the problem. We demonstrate efficiency of our proposed solution schemes evidenced from numerical experiments and present a firm step-forward in tackling this long-standing challenge of cardinality constrained optimization.
Gao, Jianjun.
Adviser: Duan Li.
Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: .
Thesis (Ph.D.)--Chinese University of Hong Kong, 2009.
Includes bibliographical references (leaves 134-142).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese.
Styles APA, Harvard, Vancouver, ISO, etc.
8

« Cardinality constrained portfolio selection using clustering methodology ». 2011. http://library.cuhk.edu.hk/record=b5894828.

Texte intégral
Résumé :
Jiang, Kening.
"August 2011."
Thesis (M.Phil.)--Chinese University of Hong Kong, 2011.
Includes bibliographical references (p. 90-93).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Portfolio Selection Using Clustering Methodology --- p.7
Chapter 2.1 --- Heuristic algorithm --- p.8
Chapter 2.1.1 --- Step 1: Security transformation by factor model --- p.8
Chapter 2.1.2 --- Step 2: Clustering algorithm --- p.10
Chapter 2.1.3 --- Step 3: Representative selection by t he Sliarpe ratio --- p.16
Chapter 2.2 --- Numerical results --- p.17
Chapter 3 --- Modified Portfolio Selection Using Clustering Methodology --- p.22
Chapter 3.1 --- Analysis of artificial factors --- p.23
Chapter 3.2 --- Problem reformulation --- p.27
Chapter 3.3 --- Numerical results --- p.29
Chapter 4 --- Minimum Variance Point --- p.70
Chapter 4.1 --- Iterative elimination scheme I --- p.72
Chapter 4.2 --- Iterative elimination scheme II --- p.74
Chapter 4.3 --- Orthogonal matrix mapping --- p.76
Chapter 4.4 --- Condition to solve diagonal dominant problem --- p.77
Chapter 4.5 --- L1 formulation --- p.82
Chapter 4.6 --- Numerical results --- p.85
Chapter 5 --- Summary and Future work --- p.88
Styles APA, Harvard, Vancouver, ISO, etc.
9

« Cardinality constrained discrete-time linear-quadratic control ». 2005. http://library.cuhk.edu.hk/record=b5892706.

Texte intégral
Résumé :
Gao Jianjun.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.
Includes bibliographical references (leaves 75-76).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Solution Framework Using Dynamic Programming --- p.7
Chapter 2.1 --- Difficulty of using dynamic programming --- p.8
Chapter 2.2 --- Scalar-state problems --- p.12
Chapter 2.3 --- Time-invariant system --- p.17
Chapter 2.4 --- Illustrative example of a scalar-state problem --- p.21
Chapter 3 --- Cardinality Constrained Quadratic Optimization --- p.26
Chapter 3.1 --- Reformulation --- p.27
Chapter 3.2 --- NP hardness --- p.31
Chapter 3.3 --- Solving CCQP with an efficient branch and bound method --- p.34
Chapter 3.3.1 --- Efficient branch and bound algorithm --- p.34
Chapter 3.3.2 --- Geometrical interpretation of the proposed ranking order --- p.48
Chapter 3.3.3 --- Additional algorithmic ideas for enhancing computational efficiency --- p.56
Chapter 3.4 --- Numerical example and computational results --- p.60
Chapter 4 --- Summary and Future Work --- p.73
Styles APA, Harvard, Vancouver, ISO, etc.
10

McCarthy, Philip James. « Cardinality Constrained Robust Optimization Applied to a Class of Interval Observers ». Thesis, 2013. http://hdl.handle.net/10012/7907.

Texte intégral
Résumé :
Observers are used in the monitoring and control of dynamical systems to deduce the values of unmeasured states. Designing an observer requires having an accurate model of the plant — if the model parameters are characterized imprecisely, the observer may not provide reliable estimates. An interval observer, which comprises an upper and lower observer, bounds the plant's states from above and below, given the range of values of the imprecisely characterized parameters, i.e., it defines an interval in which the plant's states must lie at any given instant. We propose a linear programming-based method of interval observer design for two cases: 1) only the initial conditions of the plant are uncertain; 2) the dynamical parameters are also uncertain. In the former, we optimize the transient performance of the interval observers, in the sense that the volume enclosed by the interval is minimized. In the latter, we optimize the steady state performance of the interval observers, in the sense that the norm of the width of the interval is minimized at steady state. Interval observers are typically designed to characterize the widest interval that bounds the states. This thesis proposes an interval observer design method that utilizes additional, but still-incomplete information, that enables the designer to identify tighter bounds on the uncertain parameters under certain operating conditions. The number of bounds that can be refined defines a class of systems. The definition of this class is independent of the specific parameters whose bounds are refined. Applying robust optimization techniques, under a cardinality constrained model of uncertainty, we design a single observer for an entire class of systems. These observers guarantee a minimum level of performance with respect to the aforementioned metrics, as we optimize the worst-case performance over a given class of systems. The robust formulation allows the designer to tune the level of uncertainty in the model. If many of the uncertain parameter bounds can be refined, the nominal performance of the observer can be improved, however, if few or none of the parameter bounds can be refined, the nominal performance of the observer can be designed to be more conservative.
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Cardinality constrained optimization"

1

de Farias, Ismael R., et George L. Nemhauser. « A Polyhedral Study of the Cardinality Constrained Knapsack Problem ». Dans Integer Programming and Combinatorial Optimization, 291–303. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47867-1_21.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Khokhar, Mulazim-Ali, Kris Boudt et Chunlin Wan. « Cardinality-Constrained Higher-Order Moment Portfolios Using Particle Swarm Optimization ». Dans Applying Particle Swarm Optimization, 169–87. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70281-6_10.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Streichert, Felix, Holger Ulmer et Andreas Zell. « Evolutionary Algorithms and the Cardinality Constrained Portfolio Optimization Problem ». Dans Operations Research Proceedings, 253–60. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-642-17022-5_33.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Cui, Min, Donglei Du, Ling Gai et Ruiqi Yang. « A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions ». Dans Combinatorial Optimization and Applications, 96–110. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92681-6_9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Ahmad, Faisal, Faraz Hasan, Mohammad Shahid, Jahangir Chauhan et Mohammad Imran. « Cardinality Constrained Portfolio Selection Strategy Based on Hybrid Metaheuristic Optimization Algorithm ». Dans Proceedings of International Conference on Data Science and Applications, 853–62. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-6631-6_59.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Pleshakov, Michael, Sergei Sidorov et Kirill Spiridonov. « Convergence Analysis of Penalty Decomposition Algorithm for Cardinality Constrained Convex Optimization in Hilbert Spaces ». Dans Mathematical Optimization Theory and Operations Research, 141–53. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-49988-4_10.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Mayambala, Fred, Elina Rönnberg et Torbjörn Larsson. « Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition ». Dans Operations Research Proceedings, 385–92. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28697-6_54.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Ruiz-Torrubiano, Rubén, Sergio García-Moratilla et Alberto Suárez. « Optimization Problems with Cardinality Constraints ». Dans Computational Intelligence in Optimization, 105–30. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12775-5_5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Régin, Jean-Charles. « Combination of Among and Cardinality Constraints ». Dans Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 288–303. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11493853_22.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Kocjan, Waldemar, et Per Kreuger. « Filtering Methods for Symmetric Cardinality Constraint ». Dans Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 200–208. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24664-0_14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Cardinality constrained optimization"

1

Friedrich, Tobias, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit et Simon Wietheger. « Crossover for cardinality constrained optimization ». Dans GECCO '22 : Genetic and Evolutionary Computation Conference. New York, NY, USA : ACM, 2022. http://dx.doi.org/10.1145/3512290.3528713.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Cheng, Runze, et Jianjun Gao. « On cardinality constrained mean-CVaR portfolio optimization ». Dans 2015 27th Chinese Control and Decision Conference (CCDC). IEEE, 2015. http://dx.doi.org/10.1109/ccdc.2015.7162076.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Gomez, Miguel A., Carmen X. Flores et Maria A. Osorio. « Hybrid search for cardinality constrained portfolio optimization ». Dans the 8th annual conference. New York, New York, USA : ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144302.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Parizy, Matthieu, Przemyslaw Sadowski et Nozomu Togawa. « Cardinality Constrained Portfolio Optimization on an Ising Machine ». Dans 2022 IEEE 35th International System-on-Chip Conference (SOCC). IEEE, 2022. http://dx.doi.org/10.1109/socc56010.2022.9908082.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Zhang, Jize, Tim Leung et Aleksandr Aravkin. « A Relaxed Optimization Approach for Cardinality-Constrained Portfolios ». Dans 2019 18th European Control Conference (ECC). IEEE, 2019. http://dx.doi.org/10.23919/ecc.2019.8796164.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Cui, Tianxiang, Shi Cheng et Ruibin Bai. « A combinatorial algorithm for the cardinality constrained portfolio optimization problem ». Dans 2014 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2014. http://dx.doi.org/10.1109/cec.2014.6900357.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

McCarthy, Philip James, Christopher Nielsen et Stephen L. Smith. « Cardinality constrained robust optimization applied to a class of interval observers ». Dans 2014 American Control Conference - ACC 2014. IEEE, 2014. http://dx.doi.org/10.1109/acc.2014.6859149.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Chen, Angela H. L., Yun-Chia Liang et Chia-Chien Liu. « An artificial bee colony algorithm for the cardinality-constrained portfolio optimization problems ». Dans 2012 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2012. http://dx.doi.org/10.1109/cec.2012.6252920.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Suthiwong, Dit, et Maleerat Sodanil. « Cardinality-constrained Portfolio optimization using an improved quick Artificial Bee Colony Algorithm ». Dans 2016 International Computer Science and Engineering Conference (ICSEC). IEEE, 2016. http://dx.doi.org/10.1109/icsec.2016.7859943.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Min, Jiang, Zhiqing Meng, Gengui Zhou et Rui Shen. « A Smoothing Penalty Function Algorithm for Two-Cardinality Sparse Constrained Optimization Problems ». Dans 2018 14th International Conference on Computational Intelligence and Security (CIS). IEEE, 2018. http://dx.doi.org/10.1109/cis2018.2018.00018.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Cardinality constrained optimization » pour d’autres types de sources :
Articles de revues
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie