Re: Minimization of Matrix function with norm constraint

Here is one more question.

How the algorithm should be revisied when we using inequality constraint
instead of equality ?

i.e. y_i' y_i <= 1.

The basic direction of the algorithm still remain?




.

Relevant Pages

  • Re: Minimization of Matrix function with norm constraint
    ... How the algorithm should be revisied when we using inequality constraint ... instead of equality? ... The basic direction of the algorithm still remain? ...
    (sci.math.num-analysis)
  • Re: puzzle
    ... this remains a stunning irrevelance to the fact that the XOR ... > have to assume that "in addition to test for equality, ... Even if the bitwise representation is not accessible any ... The algorithm will still be O. ...
    (comp.programming)
  • Re: puzzle
    ... You have to assume that "in addition to test for equality, we can regard numbers as bitwise accessible". ... language that allows division by two can easily be used to make you own binary representation. ... The algorithm will still be O. ... atomic XOR, you have a BAD Oalgorithm. ...
    (comp.programming)
  • Re: fmincon with non-linear constraints?
    ... Version 4 or newer versions of Optimization Toolbox has fmincon ... Algorithm 'interior-point' that can handle your problem. ... algorithm cannot be used with inequality constraints. ... Is there a way to use the large-scale routine with non-linear equality ...
    (comp.soft-sys.matlab)
  • Re: puzzle
    ... >> have to assume that "in addition to test for equality, ... Even if the bitwise representation is not accessible any ... The algorithm will still be O. ... The XOR solution continues to suck. ...
    (comp.programming)