A Limitation of V-Matrix based Methods

08/27/2018
by   Niharika Gauraha, et al.
0

To estimate the conditional probability functions based on the direct problem setting, V-matrix based method was proposed. We construct V-matrix based constrained quadratic programming problems for which the inequality constraints are inconsistent. In particular, we would like to present that the constrained quadratic optimization problem for conditional probability estimation using V-matrix method may not have a consistent solution always.

READ FULL TEXT
research
07/23/2014

Quadratically constrained quadratic programming for classification using particle swarms and applications

Particle swarm optimization is used in several combinatorial optimizatio...
research
08/25/2016

Minimizing Quadratic Functions in Constant Time

A sampling-based optimization method for quadratic functions is proposed...
research
04/26/2021

Quadratic Payments with constrained probabilities

Dealing with quadratic payments, marginal probability is usually conside...
research
02/06/2021

Linear Matrix Inequality Approaches to Koopman Operator Approximation

The regression problem associated with finding a matrix approximation of...
research
01/18/2021

Explicit continuation methods with L-BFGS updating formulas for linearly constrained optimization problems

This paper considers an explicit continuation method with the trusty tim...
research
04/22/2020

Eigendecomposition of Q in Equally Constrained Quadratic Programming

When applying eigenvalue decomposition on the quadratic term matrix in a...
research
01/16/2018

One Way Function Candidate based on the Collatz Problem

The one way function based on Collatz problem is proposed. While Colatz ...

Please sign up or login with your details

Forgot password? Click here to reset