Thematische Bibliographien / Quadratic programmin

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Quadratic programmin“

Autor: Grafiati

Veröffentlicht am 1. April 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Quadratic programmin" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Quadratic programmin"

Majeed, Amir Sabir, und Fadhil Salman Abed. „A Proposed Method to Solve Quadratic Fractional Programming Problem by Converting to Double Linear Programming“. Journal of Zankoy Sulaimani - Part A 19, Nr. 1 (05.06.2016): 239–49. http://dx.doi.org/10.17656/jzs.10602.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yamashita, Hiroshi, und Hiroshige Dan. „GLOBAL CONVERGENCE OF A TRUST REGION SEQUENTIAL QUADRATIC PROGRAMMING METHOD“. Journal of the Operations Research Society of Japan 48, Nr. 1 (2005): 41–56. http://dx.doi.org/10.15807/jorsj.48.41.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Turlach, Berwin A., und Stephen J. Wright. „Quadratic programming“. Wiley Interdisciplinary Reviews: Computational Statistics 7, Nr. 2 (19.01.2015): 153–59. http://dx.doi.org/10.1002/wics.1344.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Serna-Diaz, Raquel, Raimundo Santos Leite und Paulo J. S. Silva. „A mixed quadratic programming model for a robust support vector machine“. Selecciones Matemáticas 8, Nr. 1 (30.06.2021): 27–36. http://dx.doi.org/10.17268/sel.mat.2021.01.03.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sulaiman, Nejmaddin A., und Maher A. Nawkhass. „Using Standard Division to Solve Multi- Objective Quadratic Fractional Programming Problems“. Journal of Zankoy Sulaimani - Part A 18, Nr. 3 (05.06.2016): 157–64. http://dx.doi.org/10.17656/jzs.10544.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sulaiman, Najmaddin A., und Basiya K. Abulrahim. „Arithmetic Average Transformation Technique to Solve Multi-Objective Quadratic Programming Problem“. Journal of Zankoy Sulaimani - Part A 15, Nr. 1 (17.12.2012): 57–69. http://dx.doi.org/10.17656/jzs.10233.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wilson, G. „Quadratic programming analogs“. IEEE Transactions on Circuits and Systems 33, Nr. 9 (September 1986): 907–11. http://dx.doi.org/10.1109/tcs.1986.1086021.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Boggs, Paul T., und Jon W. Tolle. „Sequential Quadratic Programming“. Acta Numerica 4 (Januar 1995): 1–51. http://dx.doi.org/10.1017/s0962492900002518.

Der volle Inhalt der Quelle

Annotation:

Since its popularization in the late 1970s, Sequential Quadratic Programming (SQP) has arguably become the most successful method for solving nonlinearly constrained optimization problems. As with most optimization methods, SQP is not a single algorithm, but rather a conceptual method from which numerous specific algorithms have evolved. Backed by a solid theoretical and computational foundation, both commercial and public-domain SQP algorithms have been developed and used to solve a remarkably large set of important practical problems. Recently large-scale versions have been devised and tested with promising results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Beck, Amir. „Quadratic Matrix Programming“. SIAM Journal on Optimization 17, Nr. 4 (Januar 2007): 1224–38. http://dx.doi.org/10.1137/05064816x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Koyuncu, Nursel. „Computation of Parameters Using Genetic Algorithm and Sequential Quadratic Programming in Sampling“. International Journal of Computer Theory and Engineering 7, Nr. 5 (Oktober 2015): 394–97. http://dx.doi.org/10.7763/ijcte.2015.v7.992.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Quadratic programmin"

Lau, Karen Karman School of Mathematics UNSW. „Multistage quadratic stochastic programming“. Awarded by:University of New South Wales. School of Mathematics, 1999. http://handle.unsw.edu.au/1959.4/32672.

Der volle Inhalt der Quelle

Annotation:

Multistage stochastic programming is an important tool in medium to long term planning where there are uncertainties in the data. In this thesis, we consider a special case of multistage stochastic programming in which each subprogram is a convex quadratic program. The results are also applicable if the quadratic objectives are replaced by convex piecewise quadratic functions. Convex piecewise quadratic functions have important application in financial planning problems as they can be used as very flexible risk measures. The stochastic programming problems can be used as multi-period portfolio planning problems tailored to the need of individual investors. Using techniques from convex analysis and sensitivity analysis, we show that each subproblem of a multistage quadratic stochastic program is a polyhedral piecewise quadratic program with convex Lipschitz objective. The objective of any subproblem is differentiable with Lipschitz gradient if all its descendent problems have unique dual variables, which can be guaranteed if the linear independence constraint qualification is satisfied. Expression for arbitrary elements of the subdifferential and generalized Hessian at a point can be calculated for quadratic pieces that are active at the point. Generalized Newton methods with linesearch are proposed for solving multistage quadratic stochastic programs. The algorithms converge globally. If the piecewise quadratic objective is differentiable and strictly convex at the solution, then convergence is also finite. A generalized Newton algorithm is implemented in Matlab. Numerical experiments have been carried out to demonstrate its effectiveness. The algorithm is tested on random data with 3, 4 and 5 stages with a maximum of 315 scenarios. The algorithm has also been successfully applied to two sets of test data from a capacity expansion problem and a portfolio management problem. Various strategies have been implemented to improve the efficiency of the proposed algorithm. We experimented with trust region methods with different parameters, using an advanced solution from a smaller version of the original problem and sorting the stochastic right hand sides to encourage faster convergence. The numerical results show that the proposed generalized Newton method is a highly accurate and effective method for multistage quadratic stochastic programs. For problems with the same number of stages, solution times increase linearly with the number of scenarios.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ilyes, Amy Louise. „Using linear programming to solve convex quadratic programming problems“. Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Grainger, Daniel John. „Contributions to Quadratic 0 -1 Programming“. Thesis, Lancaster University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.518188.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Xianzhi. „Resolution of Ties in Parametric Quadratic Programming“. Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1199.

Der volle Inhalt der Quelle

Annotation:

We consider the convex parametric quadratic programming problem when the end of the parametric interval is caused by a multiplicity of possibilities ("ties"). In such cases, there is no clear way for the proper active set to be determined for the parametric analysis to continue. In this thesis, we show that the proper active set may be determined in general by solving a certain non-parametric quadratic programming problem. We simplify the parametric quadratic programming problem with a parameter both in the linear part of the objective function and in the right-hand side of the constraints to a quadratic programming without a parameter. We break the analysis into three parts. We first study the parametric quadratic programming problem with a parameter only in the linear part of the objective function, and then a parameter only in the right-hand side of the constraints. Each of these special cases is transformed into a quadratic programming problem having no parameters. A similar approach is then applied to the parametric quadratic programming problem having a parameter both in the linear part of the objective function and in the right-hand side of the constraints.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Byrne, Susan Jane. „Quadratic programming using complementarity and orthogonal factorization“. Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/8893.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Morales-Perez, Jose Luis. „Computational methods for large-scale quadratic programming“. Thesis, Imperial College London, 1993. http://hdl.handle.net/10044/1/7511.

Der volle Inhalt der Quelle

Annotation:

For theoretical and practical reasons, quadratic programming problems have attracted the interest of the mathematical programming community. They naturally arise from applications and as subproblems in other numerical techniques. However most existing techniques, designed for solving small and dense problems, tend to be prohibitively expensive when applied directly to solve large-scale problems. In this work we explore methods suitable for solving large-scale sparse convex quadratic programming problems. An interior-point primal-dual algorithmic framework and its computational implementation are presented in the first part of this work. Primal and dual updates are computed at each step by iteratively solving the linear systems posed by the classical method of barriers using a preconditioned Krylov-subspace method. Several variants are suggested by a Taylor approximation of the central path. A truncated Newton strategy has been implemented in order to achieve a significant reduction in the CPU time. In the second part, sparse implementations for Lemke's algorithm and a row-action algorithm based on diagonal approximations of the Hessian, are suggested. Lemke's algorithm implementation is based on updating the sparse LU factorization of a matrix representing the basis at the current step. The implementation of the row-action algorithm relies on the efficient solution of single-constrained diagonal subproblems. In order to compare the relative merits of our implementations, numerical experimentation is conducted on two sets of problems that use randomly generated Hessian matrices and constraints taken from a subset of the netlib problems. Several aspects are studied: the use of iterative linear algebra for solving the linear systems of equations posed by the interior-point variants, the impact on the computational resources (memory and CPU) when different approaches are used to solve large scale problems, and finally, the effectiveness of a second order correction and the truncated Newton strategy implemented in the interior-point methods.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Axehill, Daniel. „Integer quadratic programming for control and communcation /“. Linköping : Department of Electrical Engineering, Linköping University, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10642.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jakee, Khan Md Kamall. „Computational convex analysis using parametric quadratic programming“. Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/45182.

Der volle Inhalt der Quelle

Annotation:

The class of piecewise linear-quadratic (PLQ) functions is a very important class of functions in convex analysis since the result of most convex operators applied to a PLQ function is a PLQ function. Although there exists a wide range of algorithms for univariate PLQ functions, recent work has focused on extending these algorithms to PLQ functions with more than one variable. First, we recall a proof in [Convexity, Convergence and Feedback in Optimal Control, Phd thesis, R. Goebel, 2000] that PLQ functions are closed under partial conjugate computation. Then we use recent results on parametric quadratic programming (pQP) to compute the inf-projection of any multivariate convex PLQ function. We implemented the algorithm for bivariate PLQ functions, and modi ed it to compute conjugates. We provide a complete space and time worst-case complexity analysis and show that for bivariate functions, the algorithm matches the performance of [Computing the Conjugate of Convex Piecewise Linear-Quadratic Bivariate Functions, Bryan Gardiner and Yves Lucet, Mathematical Programming Series B, 2011] while being easier to extend to higher dimensions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Axehill, Daniel. „Integer Quadratic Programming for Control and Communication“. Doctoral thesis, Linköpings universitet, Reglerteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10642.

Der volle Inhalt der Quelle

Annotation:

The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control methods is Model Predictive Control (MPC). In each sampling time, MPC requires the solution of a Quadratic Programming (QP) problem. To be able to use MPC for large systems, and at high sampling rates, optimization routines tailored for MPC are used. In recent years, the range of application of MPC has been extended to so-called hybrid systems. Hybrid systems are systems where continuous dynamics interact with logic. When this extension is made, binary variables are introduced in the problem. As a consequence, the QP problem has to be replaced by a far more challenging Mixed Integer Quadratic Programming (MIQP) problem, which is known to have a computational complexity which grows exponentially in the number of binary optimization variables. In modern communication systems, multiple users share a so-called multi-access channel. To estimate the information originally sent, a maximum likelihood problem involving binary variables can be solved. The process of simultaneously estimating the information sent by multiple users is called Multiuser Detection (MUD). In this thesis, the problem to efficiently solve MIQP problems originating from MPC and MUD is addressed. Four different algorithms are presented. First, a polynomial complexity preprocessing algorithm for binary quadratic programming problems is presented. By using the algorithm, some, or all, binary variables can be computed efficiently already in the preprocessing phase. In numerical experiments, the algorithm is applied to unconstrained MPC problems with a mixture of real valued and binary valued control signals, and the result shows that the performance gain can be significant compared to solving the problem using branch and bound. The preprocessing algorithm has also been applied to the MUD problem, where simulations have shown that the bit error rate can be significantly reduced compared to using common suboptimal algorithms. Second, an MIQP algorithm tailored for MPC is presented. The algorithm uses a branch and bound method where the relaxed node problems are solved by a dual active set QP algorithm. In this QP algorithm, the KKT systems are solved using Riccati recursions in order to decrease the computational complexity. Simulation results show that both the proposed QP solver and MIQP solver have lower computational complexity compared to corresponding generic solvers. Third, the dual active set QP algorithm is enhanced using ideas from gradient projection methods. The performance of this enhanced algorithm is shown to be comparable with the existing commercial state-of-the-art QP solver \cplex for some random linear MPC problems. Fourth, an algorithm for efficient computation of the search directions in an SDP solver for a proposed alternative SDP relaxation applicable to MPC problems with binary control signals is presented. The SDP relaxation considered has the potential to give a tighter lower bound on the optimal objective function value compared to the QP relaxation that is traditionally used in branch and bound for these problems, and its computational performance is better than the ordinary SDP relaxation for the problem. Furthermore, the tightness of the different relaxations is investigated both theoretically and in numerical experiments.
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the Linköping University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this material, you agree to all provisions of the copyright laws protecting it.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ahlbom, Daniel. „Quadratic Programming Models in Strategic Sourcing Optimization“. Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-334227.

Der volle Inhalt der Quelle

Annotation:

Strategic sourcing allows for optimizing purchases on a large scale.Depending on the requirements of the client and the offers provided forthem, finding an optimal or even a near-optimal solution can become computationally hard. Mixed integer programming (MIP), where theproblem is modeled as a set of linear expressions with an objectivefunction for which an optimal solution results in a minimum objectivevalue, is particularly suitable for finding competitive results. However, given the research and improvements continually being made for quadratic programming (QP), which allows for objective functions with quadratic expressions as well, comparing runtimes and objective values for finding optimal and approximate solutions is advised: for hard problems, applying the correct methods may decrease runtimes by severalorders of magnitude. In this report, comparisons between MIP and QPmodels used in four different problems with three different solverswere made, measuring both optimization and approximation performance interms of runtimes and objective values. Experiments showed that while QP holds an advantage over MIP in some cases, it is not consistentlyefficient enough to provide a significant improvement in comparison with, for example, using a different solver.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Quadratic programmin"

Gould, N. I. M. Preprocessing for quadratic programming. Chilton: Rutherford Appleton Laboratory, 2002.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kraft, Dieter. A software package for sequential quadratic programming. Koln: DFVLR, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Coleman, Thomas F. An interior Newton method for quadratic programming. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1993.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schrage, Linus. Linear, integer, and quadratic programming with LINDO. 3. Aufl. Palo Alto, CA: Scientific Press, 1986.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Education, Alberta Alberta, Hrsg. Mathematics 30: Quadratic relations. 2. Aufl. [Edmonton]: Distance Learning, Alberta Education, 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schrage, Linus. Linear, integer and quadratic programming with LINDO: User's manual. 2. Aufl. Palo Alto, Calif: Scientific Press, 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dodu, J. C. Méthodes de quasi-Newton en optimisation non linéaire. Clamart: Electricité de France, Direction des études et recherches, Service études de réseaux, Département Méthodes d'optimisation et de simulation, 1990.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

service), SpringerLink (Online, Hrsg. Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities. Boston, MA: Springer-Verlag US, 2009.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

den Hertog, D. Interior Point Approach to Linear, Quadratic and Convex Programming. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gould, N. I. M. Numerical methods for large-scale non-convex quadratic programming. Chilton: Rutherford Appleton Laboratory, 2001.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Quadratic programmin"

Bhatti, M. Asghar. „Quadratic Programming“. In Practical Optimization Methods, 495–579. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4612-0501-2_8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vanderbei, Robert J. „Quadratic Programming“. In International Series in Operations Research & Management Science, 407–23. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-74388-2_24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Horst, Reiner, Panos M. Pardalos und Nguyen V. Thoai. „Quadratic Programming“. In Nonconvex Optimization and Its Applications, 49–107. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-0015-5_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Murty, Katta G. „Quadratic programming“. In Encyclopedia of Operations Research and Management Science, 655–61. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_838.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vanderbei, Robert J. „Quadratic Programming“. In International Series in Operations Research & Management Science, 415–31. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39415-8_24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fletcher, R. „Quadratic Programming“. In Practical Methods of Optimization, 229–58. Chichester, West Sussex England: John Wiley & Sons, Ltd, 2013. http://dx.doi.org/10.1002/9781118723203.ch10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Andrei, Neculai. „Quadratic Programming“. In Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology, 243–68. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58356-3_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vanderbei, Robert J. „Quadratic Programming“. In International Series in Operations Research & Management Science, 395–411. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-5662-3_23.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vanderbei, Robert J. „Quadratic Programming“. In International Series in Operations Research & Management Science, 363–78. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-7630-6_24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kythe, Prem K. „Quadratic Programming“. In Elements of Concave Analysis and Applications, 217–32. Boca Raton, Florida : CRC Press, [2018]: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781315202259-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Quadratic programmin"

Tami, Y., K. Sebaa, M. Lahdeb und H. Nouri. „Mixed-Integer Quadratic Constrained Programming versus Quadratic Programming Methods for Distribution Network Reconfiguration“. In 2019 International Conference on Advanced Electrical Engineering (ICAEE). IEEE, 2019. http://dx.doi.org/10.1109/icaee47123.2019.9015181.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hu, Xiukun, Craig C. Douglas, Robert Lumley und Mookwon Seo. „GPU Accelerated Sequential Quadratic Programming“. In 2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES). IEEE, 2017. http://dx.doi.org/10.1109/dcabes.2017.8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jingyu Yang und Zhongyu Jiang. „Rectangle fitting via quadratic programming“. In 2015 IEEE 17th International Workshop on Multimedia Signal Processing (MMSP). IEEE, 2015. http://dx.doi.org/10.1109/mmsp.2015.7340875.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Sheng-hua, und Qun-feng Zhang. „Quadratic Fuzzy Programming with Recourse“. In Proceedings of 2006 International Conference on Machine Learning and Cybernetics. IEEE, 2006. http://dx.doi.org/10.1109/icmlc.2006.258983.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Teng, Chin-Pun, und Jorge Angeles. „A Sequential-Quadratic-Programming Algorithm Using Orthogonal Decomposition With Gerschgorin Stabilization“. In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8552.

Der volle Inhalt der Quelle

Annotation:

Abstract This paper introduces a new approach to sequential quadratic programming. Upon application of the Gerschgorin Theorem for the stabilization of the Hessian matrix and of the orthogonal-decomposition algorithm in the quadratic programming solution, this novel approach offers a faster computation and dispenses with a feasible initial guess.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Luo, Zhijun, Guohua Chen und Lirong Wang. „A Modified Sequence Quadratic Programming Method for Nonlinear Programming“. In 2011 Fourth International Joint Conference on Computational Sciences and Optimization (CSO). IEEE, 2011. http://dx.doi.org/10.1109/cso.2011.42.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Debnath, R., und H. Takahashi. „SVM Training: Second-Order Cone Programming versus Quadratic Programming“. In The 2006 IEEE International Joint Conference on Neural Network Proceedings. IEEE, 2006. http://dx.doi.org/10.1109/ijcnn.2006.246822.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kumar, Suchet, und Madhuchanda Rakshit. „Interactive fuzzy programming procedure for Trilevel Quadratic Fractional Programming“. In 2017 International Conference on Computing and Communication Technologies for Smart Nation (IC3TSN). IEEE, 2017. http://dx.doi.org/10.1109/ic3tsn.2017.8284484.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xinjilefu, X., Siyuan Feng und Christopher G. Atkeson. „Dynamic state estimation using Quadratic Programming“. In 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014). IEEE, 2014. http://dx.doi.org/10.1109/iros.2014.6942679.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Waschburger, Ronaldo, Henrique Mohallem Paiva und Roberto Kawakami Harrop Galvao. „Input delay estimation using quadratic programming“. In 2011 9th IEEE International Conference on Control and Automation (ICCA). IEEE, 2011. http://dx.doi.org/10.1109/icca.2011.6137932.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Quadratic programmin"

Eldersveld, S. K. Large-scale sequential quadratic programming algorithms. Office of Scientific and Technical Information (OSTI), September 1992. http://dx.doi.org/10.2172/10102731.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gill, Philip E., Walter Murray, Michael A. Saunders und Margaret H. Wright. Inertia-Controlling Methods for Quadratic Programming. Fort Belvoir, VA: Defense Technical Information Center, November 1988. http://dx.doi.org/10.21236/ada204664.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Prieto, Francisco J. Sequential Quadratic Programming Algorithms for Optimization. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada212800.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Eldersveld, S. K. Large-scale sequential quadratic programming algorithms. Office of Scientific and Technical Information (OSTI), September 1992. http://dx.doi.org/10.2172/6932047.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Prieto, F. Sequential quadratic programming algorithms for optimization. Office of Scientific and Technical Information (OSTI), August 1989. http://dx.doi.org/10.2172/5325989.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ponceleon, Dulce B. Barrier Methods for Large-Scale Quadratic Programming. Fort Belvoir, VA: Defense Technical Information Center, Juni 1991. http://dx.doi.org/10.21236/ada238554.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Boggs, P. T., P. D. Domich, J. E. Rogers und C. Witzgall. An interior-point method for linear and quadratic programming problems. Gaithersburg, MD: National Institute of Standards and Technology, 1991. http://dx.doi.org/10.6028/nist.ir.4556.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charnes, A., und J. Semple. Practical Error Bounds for a Class of Quadratic Programming Problems. Fort Belvoir, VA: Defense Technical Information Center, März 1991. http://dx.doi.org/10.21236/ada243249.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Murray, W., und F. J. Prieto. A sequential quadratic programming algorithm using an incomplete solution of the subproblem. Office of Scientific and Technical Information (OSTI), Mai 1993. http://dx.doi.org/10.2172/10166655.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Murray, Walter, und Francisco J. Prieto. A Sequential Quadratic Programming Algorithm Using An Incomplete Solution of the Subproblem. Fort Belvoir, VA: Defense Technical Information Center, Mai 1993. http://dx.doi.org/10.21236/ada267216.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!