Výsledky vyhľadávania - linearly-constrained quadratic programming problems

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Autori: Jiao Peng Rui Cui Shenshen Gu

Zdroj: Neurocomputing. 198:171-179

Predmety: 0211 other engineering and technologies, 02 engineering and technology

Prístupová URL adresa: http://manuscript.elsevier.com/S0925231216003301/pdf/S0925231216003301.pdf
https://www.sciencedirect.com/science/article/pii/S0925231216003301
https://dblp.uni-trier.de/db/journals/ijon/ijon198.html#GuCP16
https://doi.org/10.1016/j.neucom.2015.09.130

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix

Autori: Shenshen Gu Rui Cui

Zdroj: Fifth International Conference on Intelligent Control and Information Processing. :366-372

Predmety: 0211 other engineering and technologies, 02 engineering and technology

Prístupová URL adresa: https://ieeexplore.ieee.org/abstract/document/7010280
http://ieeexplore.ieee.org/document/7010280/

A new penalty parameter for linearly constrained 0–1 quadratic programming problems

Autori: Yanping Wang Yong Hsia

Zdroj: Optimization Letters. 7:765-778

Predmety: 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ol/ol7.html#HsiaW13
https://rd.springer.com/content/pdf/10.1007%2Fs11590-012-0458-8.pdf
https://link.springer.com/article/10.1007/s11590-012-0458-8

A Fast Algorithm for Linearly Constrained Quadratic Programming Problems with Lower and Upper Bounds

Autori: Zhongzhen Zhang Yanwu Liu

Zdroj: 2008 International Conference on MultiMedia and Information Technology. :58-61

Predmety: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005089058
https://ieeexplore.ieee.org/document/5089058/

A Polynomial Time Solvable Algorithm to Linearly Constrained Binary Quadratic Programming Problems with Q being a Tri-Diagonal Matrix

Autori: Shenshen Gu

Zdroj: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences. 3:65-72

Predmety: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: http://www.aicit.org/aiss/global/paper_detail.html?jname=AISS&q=208

A Random Generator for Large-Scale Linearly Constrained Quadratic Programming Test Problems

Autori: C. Durazzi V. Ruggiero ZANNI, Luca

Predmety: Large scale quadratic programming, projection methods, splitting methods, adaptive rules

Prístupová URL adresa: https://hdl.handle.net/11380/16078

Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem: Acceleration and parallelization of the path-following interior point method for a linearly constrained convex quadratic problem

Autori: A. Nemirovsky Y. Nesterov

Zdroj: SIAM Journal on Optimization. 1:548-564

Predmety: Convex programming, Computational methods for problems pertaining to operations research and mathematical programming, Parallel numerical computation, Quadratic programming, acceleration of the path-following polynomial time interior point method

Popis súboru: application/xml

Prístupová URL adresa: https://epubs.siam.org/doi/10.1137/0801033
https://locus.siam.org/doi/abs/10.1137/0801033
https://dblp.uni-trier.de/db/journals/siamjo/siamjo1.html#NesterovN91
https://doi.org/10.1137/0801033

Using copositivity for global optimality criteria in concave quadratic programming problems

Autori: Immanuel M. Bomze Gabriele Danninger

Zdroj: Mathematical Programming. 62:575-580

Predmety: necessary and sufficient optimality conditions, global optimization, linearly constrained concave quadratic minimization, dc-functions, 0211 other engineering and technologies, 02 engineering and technology, Quadratic programming, Nonconvex programming, global optimization

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/549160
https://doi.org/10.1007/bf01585185
https://link.springer.com/article/10.1007%2FBF01585185
https://dblp.uni-trier.de/db/journals/mp/mp62.html#DanningerB93

A reformulation-convexification approach for solving nonconvex quadratic programming problems

Autori: Hanif D. Sherali Cihan H. Tuncbilek

Zdroj: Journal of Global Optimization. 7:1-31

Predmety: tight linear programming relaxations, outer-approximations, 0211 other engineering and technologies, reformulation-linearization/convexification technique, 02 engineering and technology, Quadratic programming, Nonconvex programming, global optimization, linearly constrained nonconvex quadratic programming

Popis súboru: application/xml

ACCELERATING PRECONDITIONED ADMM VIA DEGENERATE PROXIMAL POINT MAPPINGS.

Autori: SUN, DEFENG YUAN, YANCHENG ZHANG, GUOJUN a ďalší

Zdroj: SIAM Journal on Optimization; 2025, Vol. 35 Issue 2, p1165-1193, 29p

Predmety: QUADRATIC programming, CONVEX programming, ASYMPTOTIC analysis, OPTIMIZATION algorithms, NUMERICAL analysis

Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints.

Autori: Locatelli, Marco Piccialli, Veronica Sudoso, Antonio M.

Zdroj: Mathematical Programming Computation; Jun2025, Vol. 17 Issue 2, p231-263, 33p

The Basic Algorithm for the Constrained Zero-One Quadratic Programming Problem with k-diagonal Matrix and Its Application in the Power System

Autori: Shenshen Gu Xinyi Chen

Zdroj: Mathematics, Vol 8, Iss 1, p 138 (2020)

Predmety: zero-one quadratic problem, combinatorial optimization, k-diagonal matrix, power system, Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://www.mdpi.com/2227-7390/8/1/138; https://doaj.org/toc/2227-7390

Prístupová URL adresa: https://doaj.org/article/9fb995b5c3eb4c3698e837008dfeddc1

A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems

Autori: Adams, Warren P. Sherali, Hanif D.

Zdroj: Management Science, 1986 Oct 01. 32(10), 1274-1290.

Prístupová URL adresa: https://www.jstor.org/stable/2631700

A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems

Autori: Kortanek, K. O. Zhu, Jishan

Zdroj: Mathematics of Operations Research, 1993 Feb 01. 18(1), 116-127.

Prístupová URL adresa: https://www.jstor.org/stable/3690156

Semi-proximal Augmented Lagrangian-Based Decomposition Methods for Primal Block-Angular Convex Composite Quadratic Conic Programming Problems.

Autori: Lam, Xin-Yee Sun, Defeng Toh, Kim-Chuan

Zdroj: INFORMS Journal on Optimization; Summer2021, Vol. 3 Issue 3, p254-277, 24p

Predmety: DECOMPOSITION method, STOCHASTIC programming, QUADRATIC programming, PERSONAL computers, PROBLEM solving

A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem

Autori: Pang, Jong-Shi

Zdroj: Mathematics of Operations Research, 1987 Aug 01. 12(3), 474-484.

Prístupová URL adresa: https://www.jstor.org/stable/3689978

Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems.

Autori: Zhang, Bo Gao, YueLin Liu, Xia a ďalší

Zdroj: Journal of Global Optimization; May2023, Vol. 86 Issue 1, p61-92, 32p

Predmety: NONCONVEX programming, APPROXIMATION algorithms, SCIENTIFIC communication, QUADRATIC programming, OPTIMIZATION algorithms, GLOBAL optimization

Parallel splitting methods for linearly constrained quadratic programs

Autori: GALLIGANI, Emanuele V. RUGGIERO ZANNI, Luca

Predmety: Parallel computing, quadratic programming, linear complementarity problems, parallel iterative solvers

Prístupová URL adresa: https://hdl.handle.net/11380/593597

QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems.

Autori: LING LIANG XUDONG LI DEFENG SUN a ďalší

Zdroj: ACM Transactions on Mathematical Software; Sep2022, Vol. 48 Issue 3, p1-27, 27p

Predmety: QUADRATIC programming, GAUSS-Seidel method, CONVEX programming, INTEGRATED software, ALGORITHMS

Creating Better Collision-Free Trajectory for Robot Motion Planning by Linearly Constrained Quadratic Programming.

Autori: Liu, Yizhou Zha, Fusheng Li, Mantian a ďalší

Zdroj: Frontiers in Neurorobotics; 8/9/2021, Vol. 15, p1-16, 16p

Predmety: QUADRATIC programming, TRAJECTORY optimization, ROBOT motion, AVOIDANCE conditioning, SPACE trajectories, MATHEMATICAL optimization, CONFIGURATION space