Suchergebnisse - linearly-constrained quadratic programming problems

  1. 1

    Optimizing a Linearly Constrained Quadratic Programming Problem Using Eigen-Value Decomposition and Resultant Vector Ascent Method von Sarkar, Subhadip

    ISSN: 2349-5103, 2199-5796
    Veröffentlicht: New Delhi Springer India 01.12.2025
    “… This paper suggests an iterative method for optimizing a Quadratic Programming Problem, constrained with a set of Linear Inequalities (less than type …”
    Volltext
    Journal Article
  2. 2

    A successive domain-reduction scheme for linearly constrained quadratic integer programming problems von Wang, Fenlan

    ISSN: 0160-5682, 1476-9360
    Veröffentlicht: Taylor & Francis 03.10.2021
    Veröffentlicht in The Journal of the Operational Research Society (03.10.2021)
    “… A new exact solution method is developed in this paper for solving nonseparable linearly constrained quadratic integer programming problems with convex, concave or indefinite objective functions …”
    Volltext
    Journal Article
  3. 3

    A new penalty parameter for linearly constrained 0–1 quadratic programming problems von Hsia, Yong, Wang, Yanping

    ISSN: 1862-4472, 1862-4480
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.04.2013
    Veröffentlicht in Optimization letters (01.04.2013)
    “… The equivalence between the linearly constrained 0–1 quadratic programming problem and the continuous quadratic programming problem is studied in this note …”
    Volltext
    Journal Article
  4. 4

    Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems von Gu, Shenshen, Cui, Rui, Peng, Jiao

    ISSN: 0925-2312, 1872-8286
    Veröffentlicht: Elsevier B.V 19.07.2016
    Veröffentlicht in Neurocomputing (Amsterdam) (19.07.2016)
    “… However, it is NP-hard and lacks efficient algorithms. Due to this reason, in this paper, some novel polynomial algorithms are proposed to solve a class of unconstrained and linearly constrained binary quadratic programming problems …”
    Volltext
    Journal Article
  5. 5

    CSOLNP: Numerical Optimization Engine for Solving Non-linearly Constrained Problems von Zahery, Mahsa, Maes, Hermine H., Neale, Michael C.

    ISSN: 1832-4274, 1839-2628
    Veröffentlicht: Cambridge, UK Cambridge University Press 01.08.2017
    Veröffentlicht in Twin research and human genetics (01.08.2017)
    “… R package version, 1) alongside some improvements. CSOLNP solves non-linearly constrained optimization problems using a Sequential Quadratic Programming (SQP) algorithm. CSOLNP, NPSOL …”
    Volltext
    Journal Article
  6. 6

    Inequalities for sums of squares of reranked differences involving ties and missing data von Speevak, Ted

    ISSN: 0361-0926, 1532-415X
    Veröffentlicht: Philadelphia Taylor & Francis 02.09.2017
    Veröffentlicht in Communications in statistics. Theory and methods (02.09.2017)
    “… An inequality for the sum of squares of rank differences associated with Spearman's rank correlation coefficient, when ties and missing data are present in …”
    Volltext
    Journal Article
  7. 7

    Sparsity-Aware Noise Subspace Fitting for DOA Estimation von Zheng, Chundi, Chen, Huihui, Wang, Aiguo

    ISSN: 1424-8220, 1424-8220
    Veröffentlicht: Switzerland MDPI AG 21.12.2019
    Veröffentlicht in Sensors (Basel, Switzerland) (21.12.2019)
    “… Our formulation leads to a convex linearly constrained quadratic programming (LCQP) problem that enjoys global convergence without the need of accurate initialization and can be easily solved by existing LCQP solvers …”
    Volltext
    Journal Article
  8. 8

    Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix von Shenshen Gu, Rui Cui

    ISBN: 1479936499, 9781479936496
    Veröffentlicht: IEEE 01.08.2014
    “… Binary quadratic programming (BQP) is a typical integer programming problem widely applied in the field of signal processing, economy, management and engineering …”
    Volltext
    Tagungsbericht
  9. 9

    A Fast Algorithm for Linearly Constrained Quadratic Programming Problems with Lower and Upper Bounds von Yanwu Liu, Zhongzhen Zhang

    ISBN: 9780769535562, 0769535569
    Veröffentlicht: IEEE 01.12.2008
    Veröffentlicht in Multimedia and Information Technology, Proceedings (01.12.2008)
    “… There are many applications related to linearly constrained quadratic programs subjected to upper and lower bounds …”
    Volltext
    Tagungsbericht
  10. 10

    Combining Probability Density Forecasts for Power Electrical Loads von Li, Tianyi, Wang, Yi, Zhang, Ning

    ISSN: 1949-3053, 1949-3061
    Veröffentlicht: Piscataway IEEE 01.03.2020
    Veröffentlicht in IEEE transactions on smart grid (01.03.2020)
    “… The combination problem is formulated as an optimization problem to minimize the continuous ranked probability score of the combined model by searching the weights of different individual …”
    Volltext
    Journal Article
  11. 11

    A Global Optimization Algorithm for Solving Linearly Constrained Quadratic Fractional Problems von Xu, Zhijun, Zhou, Jing

    ISSN: 2227-7390, 2227-7390
    Veröffentlicht: Basel MDPI AG 01.11.2021
    Veröffentlicht in Mathematics (Basel) (01.11.2021)
    “… This paper first proposes a new and enhanced second order cone programming relaxation using the simultaneous matrix diagonalization technique for the linearly constrained quadratic fractional programming problem …”
    Volltext
    Journal Article
  12. 12

    On Wolfe's Method for Resolving Degeneracy in Linearly Constrained Optimization von Fletcher, Roger

    ISSN: 1052-6234, 1095-7189
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2014
    Veröffentlicht in SIAM journal on optimization (01.01.2014)
    “… The method is extended to solve a general form of linearly constrained optimization problem that includes quadratic programming …”
    Volltext
    Journal Article
  13. 13

    Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied von Csizmadia, Adrienn, Csizmadia, Zsolt, Illés, Tibor

    ISSN: 1435-246X, 1613-9178
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2018
    Veröffentlicht in Central European journal of operations research (01.09.2018)
    “… This paper considers the primal quadratic simplex method for linearly constrained convex quadratic programming problems …”
    Volltext
    Journal Article
  14. 14

    The Quadratic Programming Method for Extracting Emission Line Maps from Line-blended Narrowband Images von Ueta, Toshiya, Mito, Hiroyuki, Otsuka, Masaaki, Nakada, Yoshikazu, Conn, Blair C., Ladjal, Djazia

    ISSN: 0004-6256, 1538-3881
    Veröffentlicht: Madison The American Astronomical Society 01.10.2019
    Veröffentlicht in The Astronomical journal (01.10.2019)
    “… other. This method, based on the principle of quadratic programming (QP), treats line blending as a linearly constrained quadratic optimization problem and finds the solution …”
    Volltext
    Journal Article
  15. 15

    New variants of the criss-cross method for linearly constrained convex quadratic programming von Akkeleş, Arif A., Balogh, László, Illés, Tibor

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 16.08.2004
    Veröffentlicht in European journal of operational research (16.08.2004)
    “… –dual quadratic programming problems. These criss-cross type algorithms are different from the one described in Klafszky and Terlaky [Math. Oper. und Stat. Ser. Optim. 24 (1992) 127 …”
    Volltext
    Journal Article
  16. 16

    A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters von Lu, Cheng, Wu, Junhao, Deng, Zhibin, Li, Shaoze

    ISSN: 1862-4472, 1862-4480
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2023
    Veröffentlicht in Optimization letters (01.04.2023)
    “… The singly linearly constrained separable binary quadratic programming problem (SLSBQP) has a wide variety of applications in practice …”
    Volltext
    Journal Article
  17. 17

    Computation of optimal investment allocations in a sequential portfolio optimisation von Mavungu, Masiala, Hurwitz, Evan, Marwala, Tshilidzi

    ISSN: 1995-7076, 2312-2803
    Veröffentlicht: AOSIS 26.09.2019
    Veröffentlicht in Journal of Economic and Financial Sciences (26.09.2019)
    “… Orientation: This article is related to Financial Risk Management, Investment Management and Portfolio Optimisation. Research purpose: The aim is to compute …”
    Volltext
    Journal Article
  18. 18

    Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization von Li, Hongwu, Zhang, Haibin, Xiao, Yunhai, Li, Peili

    ISSN: 1862-4472, 1862-4480
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024
    Veröffentlicht in Optimization letters (01.06.2024)
    “… The generalized alternating direction method of multipliers (ADMM) of Xiao et al. (Math Prog Comput 10:533–555, 2018) aims at the two-block linearly constrained composite convex programming problem, in which each block is in the …”
    Volltext
    Journal Article
  19. 19

    Stochastic model predictive control for probabilistically constrained Markovian jump linear systems with additive disturbance von Lu, Jianbo, Xi, Yugeng, Li, Dewei

    ISSN: 1049-8923, 1099-1239
    Veröffentlicht: Bognor Regis Wiley Subscription Services, Inc 01.10.2019
    “… Summary Model predictive control (MPC) for Markovian jump linear systems with probabilistic constraints has received much attention in recent years. However, …”
    Volltext
    Journal Article
  20. 20

    Constrained Model Predictive Control for dynamic path tracking of a bi-steerable rover on slippery grounds von Fnadi, Mohamed, Du, Wenqian, Plumet, Frédéric, Benamar, Faïz

    ISSN: 0967-0661, 1873-6939
    Veröffentlicht: Elsevier Ltd 01.02.2021
    Veröffentlicht in Control engineering practice (01.02.2021)
    “… The research works carried out in this paper deal with the control of a fast double-steering off-road mobile robot. Such kind of robots requires very high …”
    Volltext
    Journal Article