Search Results - "convex quadratic programming"
-
1
A novel neural network for solving convex quadratic programming problems subject to equality and inequality constraints
ISSN: 0925-2312, 1872-8286Published: Elsevier B.V 19.11.2016Published in Neurocomputing (Amsterdam) (19.11.2016)“…This paper proposes a neural network model for solving convex quadratic programming (CQP…”
Get full text
Journal Article -
2
Bi-affine scaling iterative method for convex quadratic programming with bound constraints
ISSN: 0378-4754Published: Elsevier B.V 01.12.2024Published in Mathematics and computers in simulation (01.12.2024)“…To solve general convex quadratic programming problems with bound constraints, this paper proposes a new interior point iterative method that is easy to be implemented…”
Get full text
Journal Article -
3
Designing Camera Networks by Convex Quadratic Programming
ISSN: 0167-7055, 1467-8659Published: Oxford Blackwell Publishing Ltd 01.05.2015Published in Computer graphics forum (01.05.2015)“…In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of…”
Get full text
Journal Article -
4
Numerical solution of box constrained separable convex quadratic programming problems
ISSN: 0252-2667, 2169-0103Published: 2024Published in Journal of information & optimization sciences (2024)“…In this paper, minimization problems with a separable convex quadratic objective function subject to a linear equality constraint/linear equality constraints, and bounds on the variables (box constraints) are considered…”
Get full text
Journal Article -
5
A neural network model for solving convex quadratic programming problems with some applications
ISSN: 0952-1976, 1873-6769Published: Elsevier Ltd 01.06.2014Published in Engineering applications of artificial intelligence (01.06.2014)“…This paper presents a capable neural network for solving strictly convex quadratic programming (SCQP…”
Get full text
Journal Article -
6
On solving a non-convex quadratic programming problem involving resistance distances in graphs
ISSN: 0254-5330, 1572-9338Published: New York Springer US 01.04.2020Published in Annals of operations research (01.04.2020)“… class of simple graphs with resistance distance matrix ( R ) which are not necessarily a tree, this problem can be reformulated as a strictly convex quadratic programming problem…”
Get full text
Journal Article -
7
An Active-Set Algorithm for Convex Quadratic Programming Subject to Box Constraints with Applications in Non-Linear Optimization and Machine Learning
ISSN: 2227-7390, 2227-7390Published: Basel MDPI AG 01.05.2025Published in Mathematics (Basel) (01.05.2025)“… Convex quadratic programming (QP) problems with box constraints appear quite frequently in various real-world applications…”
Get full text
Journal Article -
8
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
ISSN: 0926-6003, 1573-2894Published: New York Springer US 01.04.2019Published in Computational optimization and applications (01.04.2019)“…A constraint-reduced Mehrotra-predictor-corrector algorithm for convex quadratic programming is proposed…”
Get full text
Journal Article -
9
Interval convex quadratic programming problems in a general form
ISSN: 1435-246X, 1613-9178Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2017Published in Central European journal of operations research (01.09.2017)“…This paper addresses the problem of computing the minimal and the maximal optimal value of a convex quadratic programming (CQP…”
Get full text
Journal Article -
10
A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
ISSN: 0375-9601, 1873-2429Published: Elsevier B.V 10.06.2002Published in Physics letters. A (10.06.2002)“…A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems…”
Get full text
Journal Article -
11
A Neurodynamic Optimization Approach to Bilevel Quadratic Programming
ISSN: 2162-237X, 2162-2388Published: United States IEEE 01.11.2017Published in IEEE transaction on neural networks and learning systems (01.11.2017)“…). Based on the Karush-Kuhn-Tucker (KKT) theorem, the BQP problem is reduced to a one-level mathematical program subject to complementarity constraints (MPCC…”
Get full text
Journal Article -
12
A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming
ISSN: 0926-6003, 1573-2894Published: New York Springer Nature B.V 01.10.2006Published in Computational optimization and applications (01.10.2006)“…In this paper we propose a smoothing Newton-type algorithm for the problem of minimizing a convex quadratic function subject to finitely many convex quadratic inequality constraints…”
Get full text
Journal Article -
13
Nonlinear optimization and support vector machines
ISSN: 1619-4500, 1614-2411Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2018Published in 4OR (01.06.2018)“…Support Vector Machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields…”
Get full text
Journal Article -
14
Characterization of optimal points in binary convex quadratic programming
ISSN: 0233-1934, 1029-4945Published: Philadelphia Taylor & Francis Group 01.02.2007Published in Optimization (01.02.2007)“…In (Recht, P., 2001, Identifying non-active restrictions in convex quadratic programming…”
Get full text
Journal Article -
15
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
ISSN: 0166-218X, 1872-6771Published: Elsevier B.V 28.03.2009Published in Discrete Applied Mathematics (28.03.2009)“…Let ( QP ) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints…”
Get full text
Journal Article -
16
Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
ISSN: 1002-0071, 1745-5391Published: Department of Mathematics,Tongji University, Shanghai 200092, China%Department of Mathematics, Shanghai University, Shanghai 200436, China 01.09.2004Published in Progress in natural science (01.09.2004)“… Based on the convex quadratic programming relaxation and the randomized rounding strategy, a 2-approximation algorithm is obtained for a special case with the all-or-none property and then a…”
Get full text
Journal Article -
17
Convex Quadratic Programming for Maximizing Sum Throughput in MIMO-NOMA Multicell Networks
Published: IEEE 01.12.2017Published in GLOBECOM : proceedings : 2017 IEEE Global Communications Conference : Singapore, 4-8 December 2017 (01.12.2017)“… the overall sum throughput subject to the users' quality-of-service requirements, which are imposed independently on the users' channel conditions…”
Get full text
Conference Proceeding -
18
An interior point Newton-like method for non-negative least-squares problems with degenerate solution
ISSN: 1070-5325, 1099-1506Published: Chichester, UK John Wiley & Sons, Ltd 01.12.2006Published in Numerical linear algebra with applications (01.12.2006)“…An interior point approach for medium and large non‐negative linear least‐squares problems is proposed. Global and locally quadratic convergence is shown even…”
Get full text
Journal Article -
19
Suboptimal Explicit Receding Horizon Control via Approximate Multiparametric Quadratic Programming
ISSN: 0022-3239, 1573-2878Published: New York, NY Springer 01.04.2003Published in Journal of optimization theory and applications (01.04.2003)“… 1-2 for computing explicit receding horizon control (RHC) laws for linear systems subject to linear constraints on input and state variables…”
Get full text
Journal Article -
20
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
ISSN: 0925-5001, 1573-2916Published: Boston Springer US 01.02.2013Published in Journal of global optimization (01.02.2013)“…In this paper we examine non-convex quadratic optimization problems over a quadratic constraint under unknown but bounded interval perturbation of problem data…”
Get full text
Journal Article