Could someone kindly suggest a method of solving the following constrained (equality and inequality)

nidantasnu 2022-07-07 Answered
Could someone kindly suggest a method of solving the following constrained (equality and inequality) system of equations in the least squares fashion?
min x 1 2 A x b 2 2
such that
x i + x j = 1 for a certain  i , j 0 < x k < τ k where  k i , j
τ k is the upper bound for x k .
You can still ask an expert for help

Want to know more about Inequalities systems and graphs?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

Elias Flores
Answered 2022-07-08 Author has 24 answers
You can solve this problem using the projected gradient method (or an accelerated projected gradient method). Let S be the set of all x that satisfy the given constraints. The gradient of the objective function f is
f ( x ) = A T ( A x b )
and the projected gradient iteration is
x + = P S ( x t f ( x ) ) .
x + = P S ( x t f ( x ) ) .
The function P S projects onto S. This projection step requires solving a linear algebra subproblem. (Note that the second set of constraints can be handled independently of the first set of constraints. If the linear constraints are described more explicitly, we can give more detail.) The projected gradient iteration will converge if the step size t > 0 is sufficiently small.
Did you like this example?
Subscribe for all access

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-06-29
The problem at hand can be summarized as follows: we have to allocate a ressource to n production units. The allocation to production unit i is x i . Each of the production unit will produce at different rate. Let us define r = ( r 1 , . . . , r n ) where the production rate of unit i is r i .
We have also a method to come up with an initial allocation ( ( x 1 , . . . , x n ) for a total desired production R (a given constant). We do not give any details about this method because it is irrelevant to the question.
So the method finds a solution x = ( x 1 , . . . , x n ) to the system
R = r x T
where x 0.
We also regroup the production units into categories. We would like to obtain a minimum production from certain categories and a maximum production in other categories. This can be expressed by a system of linear inequalities B x b.
The initial solution found by the method does not necessarily meets all the constraints.
My Questions:
1) What would be the best approach to shift the production from one category of production units to another when the constraints are not met (and still have R = r x T )? We would like the final solution not too far from the initial one and the all the constraints are respected.
2) Can you provide some reference (papers, website, etc.) for this type of problems?
asked 2022-06-21
How can we solve this system of linear inequalities?
Let c i be a given non-negative integer for all i { 1 , , n }. would like to find the non-negative integers a i and b i for all i { 1 , , n } such that:
{ c i = a i + b i ,  for all  i { 1 , , n } a i < a i + 1 ,  for all  i { 1 , , n 1 } b i > b i + 1 ,  for all  i { 1 , , n 1 } b i 0  and integer  ,  for all  i { 1 , , n } a i 0  and integer  ,  for all  i { 1 , , n }
asked 2022-06-24
trying to solve a systems of equations with one inequality
I am trying to create a website that would run off this mathematical formula. I have tried to solve it but I got that there was no answer. I am only in pre-algebra and want a second opinion on if I got the equation right.
1.2 = x y
x > 1
y > 1
x > y + 2.3
Is there a solution and if so how do you get it?
asked 2022-06-15
Let a , b , c be whole numbers so that
1 a 3
2 b 4
3 c 5
Find number of solutions of the equation, a + b + c = 10. Note: Please use FPC/PnC to answer this instead of the binomial theorem
asked 2022-06-15
If we consider N as a subset of the usual metric space of real numbers R, we can think in a fundamental system of neighbourhoods (FSN) of N. I need to prove that does not exist a countable FSN, and as a suggestion Dieudonne (The autor of the book Modern analysis) says: Use contradiction. If ( ( a n m )) is a doble sequence of positive numbers, the sequence ( b n ) = a n n 2 is such that for no integer m is valid the inequality b n a m n for all the integers n.
How can I use this fact to prove it?
asked 2022-05-24
  • A line with a slope of –2 passes through the point (-6, 12) what is its equation in slope-intercept form?
asked 2022-06-03
The given question is :
Consider the sets defined by the real solutions of the inequalities
A = { ( x , y ) : x 2 + y 4 1 } B = { ( x , y ) : x 4 + y 6 1 }
A. B A
B. A B
C. Each of the sets A B, B A and A B is non-empty
D. None of the above
how to solve this without using any such plotter?