Results 41 to 50 of about 6,874,253 (304)
International Journal of Advanced Robotic Systems, 2018 The quadratic programming problem has broad applications in mobile robot path planning. This article presents an efficient optimization algorithm for globally solving the quadratic programming problem.
Lei Cai, Juanjuan Yang, Li Zhao, Lan Wu
doaj +1 more source
Fuzzy Information and Engineering, 2023 To address the compounded uncertainty in the observed output data, we introduce a new method of fuzzy regression modeling which is based on quadratic programming and fuzzy weights, so that the objective function represents the quadratic error for all of ...
Mahdi Danesh +3 more
doaj +1 more source
A Novel Method for Optimal Control of Piecewise Affine Systems Using Semi-Definite Programming [PDF]
International Journal of Industrial Electronics, Control and Optimization, 2020 : In this paper, a novel optimal control design method by discontinuous quadratic Lyapunov function and continuous quadratic Lyapunov function for 2-dimensional piecewise affine systems via semi-definite programming and LMI constraints is proposed.In ...
Majid Akbarian +2 more
doaj +1 more source
A Simple SQP Algorithm for Constrained Finite Minimax Problems
The Scientific World Journal, 2014 A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming.
Lirong Wang, Zhijun Luo
doaj +1 more source
Mathematics, 2020 Zero-one quadratic programming is a classical combinatorial optimization problem that has many real-world applications. However, it is well known that zero-one quadratic programming is non-deterministic polynomial-hard (NP-hard) in general.
Shenshen Gu, Xinyi Chen
doaj +1 more source
Approximating sparse quadratic programs
Theoretical Computer Science, 2022 Given a matrix $A \in \mathbb{R}^{n\times n}$, we consider the problem of maximizing $x^TAx$ subject to the constraint $x \in \{-1,1\}^n$. This problem, called MaxQP by Charikar and Wirth [FOCS'04], generalizes MaxCut and has natural applications in data clustering and in the study of disordered magnetic phases of matter. Charikar and Wirth showed that
Danny Hermelin +3 more
openaire +3 more sources
A simple effective heuristic for embedded mixed-integer quadratic programming [PDF]
American Control Conference, 2015 In this paper we propose a fast optimization algorithm for approximately minimizing convex quadratic functions over the intersection of affine and separable constraints (i.e., the Cartesian product of possibly nonconvex real sets).
Reza Takapoui +3 more
semanticscholar +1 more source
An improved constrained dynamic matrix control for temperature in an industrial coke furnace
Measurement + Control, 2019 In order to derive the feasible control law of the constrained model predictive control scheme, quadratic programming has been introduced as an effective method. It is known that the typical performance index for model predictive control strategies under
Hongbo Zou, Limin Wang
doaj +1 more source
An Algorithm for Solving Quadratic Programming Problems [PDF]
Computer Science Journal of Moldova, 1997 Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix ...
V. Moraru
doaj
A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
Journal of Inequalities and Applications, 2019 In this paper, we present a sequential semidefinite programming (SSDP) algorithm for nonlinear semidefinite programming. At each iteration, a linear semidefinite programming subproblem and a modified quadratic semidefinite programming subproblem are ...
Jian Ling Li, Hui Zhang
doaj +1 more source