Filters
Maximization of a Convex Quadratic Form on a Polytope: Factorization and the Chebyshev Norm Bounds
Maximization of a convex quadratic form on a convex polyhedral set is an NP-hard problem. We focus on computing an upper bound based on a factorization of the quadratic form matrix and employment ...
Pure mathematics
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Maximization of a convex quadratic form on a polytope: Factorization and the Chebyshev norm bounds
Maximization of a convex quadratic form on a convex polyhedral set is an NP-hard problem. We focus on computing an upper bound based on a factorization of the quadratic form matrix and employment ...
Economic Theory
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On solvability of convex noncoercive quadratic programming problems
Using a known result on minimization of convex functionals on polyhedral cones, the Frank--Wolfe theorem, and basic linear algebra, we give a simple proof that the general convex quadratic programming problem which satisfie...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Maximization of a PSD Quadratic Form and Factorization
We consider the problem of maximization of a convex quadratic form on a convex polyhedral set, which is known to be NP-hard. In particular, we focus on upper bounds on the maximum value. We investigate utilization ...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Quadratic programming with separable convex constraints and solving of 3D contact problems with friction
The paper deals with a method for numerical minimization of convex functions with separable convex constraints. Applications to 3D contact problems with friction are shown....
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Convex Maximization with Special Feasible Regions:Computational Experiments
Main topics of the document: 0-1 convex quadratic maximization; reverse search algorithm; incremental enumeration algorithm zonotope......
BA - Obecná matematika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Interval convex quadratic programming problems in a general form
This paper addresses the problem of computing the minimal and the maximal optimal value of a convex quadratic programming (CQP) problem when the coefficients concerning on some special forms of CQP only, we present a unifie...
Economic Theory
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On the minimum-norm solution of convex quadratic programming
We discuss some basic concepts and present a numerical procedure for finding the minimum-norm solution of convex quadratic programs (QPs) subject to linear equality and on a convenient characterization of the solution set of con...
Economic Theory
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Convergence rate of an optimization algorithm for minimizing quadratic functions with separable convex constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with gradient projections. It generalizes recently developed algorithms of qu...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the decrease of a quadratic function along the projected--gradient path
The Euclidean gradient projection is an efficient tool for the expansion of an active set in the active set based algorithms for the solution of bound constrained quadratic programming problems. In this paper we examine the decrease of the <...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 103 286