Results 1  10
of
109,084
An interiorpoint method for largescale QP problems
, 1996
"... The author presents a primal interiorpoint method for solving largescale inequality constrained QP problems. A sequence of shifted logarithmic barrier functions is used. Their unconstrained minimization problem is solved approximately by a truncatedNewton method, given by an incomplete Lanczos de ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The author presents a primal interiorpoint method for solving largescale inequality constrained QP problems. A sequence of shifted logarithmic barrier functions is used. Their unconstrained minimization problem is solved approximately by a truncatedNewton method, given by an incomplete Lanczos
Moving Horizon Estimation for Staged QP Problems
"... Abstract — This paper considers moving horizon estimation (MHE) approach to solution of staged quadratic programming (QP) problems. Using an insight into the constrained solution structure for the growing horizon, we develop a very accurate iterative update of the arrival cost in the MHE solution. T ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — This paper considers moving horizon estimation (MHE) approach to solution of staged quadratic programming (QP) problems. Using an insight into the constrained solution structure for the growing horizon, we develop a very accurate iterative update of the arrival cost in the MHE solution
A New Technique For Inconsistent QP Problems In The SQP Method
 University at Darmstadt, Department of Mathematics, preprint 1561, Darmstadt
, 1993
"... Successful treatment of inconsistent QP problems is of major importance in the SQP method, since such occur quite often even for well behaved nonlinear programming problems. This paper presents a new technique for regularizing inconsistent QP problems, which compromises in its properties between the ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Successful treatment of inconsistent QP problems is of major importance in the SQP method, since such occur quite often even for well behaved nonlinear programming problems. This paper presents a new technique for regularizing inconsistent QP problems, which compromises in its properties between
Numerical experiments with an exact penalty function for convex inequality constrained QPproblems
, 1996
"... In this paper we describe numerical tests using the FriedlanderMart'inezSantos method for solving QP problems. It turns out that the exact penalty function given by these authors introduces some additional illconditioning, disabling accurate solution of mildly illconditioned QP's if not ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we describe numerical tests using the FriedlanderMart'inezSantos method for solving QP problems. It turns out that the exact penalty function given by these authors introduces some additional illconditioning, disabling accurate solution of mildly illconditioned QP
Numerical experiments with modern methods for large scale QPproblems
"... We describe the outcome of numerical experiments using three approaches for solving convex QPproblems in standard form 1 2 x T Bx + b T x ! = min ; A T x \Gamma a = 0 ; (0.1) x 0 ; namely the unconstrained technique of Kanzow [14], the bound constrained technique of Friedlander, Mart&ap ..."
Abstract
 Add to MetaCart
We describe the outcome of numerical experiments using three approaches for solving convex QPproblems in standard form 1 2 x T Bx + b T x ! = min ; A T x \Gamma a = 0 ; (0.1) x 0 ; namely the unconstrained technique of Kanzow [14], the bound constrained technique of Friedlander, Mart
Numerical experiments with modern methods for large scale QPproblems
"... We describe the outcome of numerical experiments using three approaches for solving convex QPproblems in standard form 1 2 x T Bx + b T x ! = min ; A T x \Gamma a = 0 ; (0.1) x 0 ; namely the unconstrained technique of Kanzow [14], the bound constrained technique of Friedlander, Mart&ap ..."
Abstract
 Add to MetaCart
We describe the outcome of numerical experiments using three approaches for solving convex QPproblems in standard form 1 2 x T Bx + b T x ! = min ; A T x \Gamma a = 0 ; (0.1) x 0 ; namely the unconstrained technique of Kanzow [14], the bound constrained technique of Friedlander, Mart
Sequential minimal optimization: A fast algorithm for training support vector machines
 Advances in Kernel MethodsSupport Vector Learning
, 1999
"... This paper proposes a new algorithm for training support vector machines: Sequential Minimal Optimization, or SMO. Training a support vector machine requires the solution of a very large quadratic programming (QP) optimization problem. SMO breaks this large QP problem into a series of smallest possi ..."
Abstract

Cited by 451 (3 self)
 Add to MetaCart
This paper proposes a new algorithm for training support vector machines: Sequential Minimal Optimization, or SMO. Training a support vector machine requires the solution of a very large quadratic programming (QP) optimization problem. SMO breaks this large QP problem into a series of smallest
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
THE Qp
"... For p ∈ (0, 1), let Qp be the subspace consisting of Möbius bounded functions in the Dirichlettype space. Based on the study of the multipliers in Qp, we establish the corona theorem for Qp. Introduction. Let △ and ∂ △ be the unit disk and circle in the finite complex plane, respectively. Also let ..."
Abstract
 Add to MetaCart
For p ∈ (0, 1), let Qp be the subspace consisting of Möbius bounded functions in the Dirichlettype space. Based on the study of the multipliers in Qp, we establish the corona theorem for Qp. Introduction. Let △ and ∂ △ be the unit disk and circle in the finite complex plane, respectively. Also let
Results 1  10
of
109,084