Consider the following problem $$ \begin{array}{crl} &\underset{y}{\max} & f(y)\\ s.t. & y_{1}A_{1}+y_{2}A_{2}+S_{1}&=C_{1},\\ & y_{3}A_{3}+y_{2}A_{4}+y_{5}A_{5}+S_{2}&=C_{2},\\ & y_{3}A_{6}+y_{4}A_{7}+S_{3}&=C_{3},\\ & S_{1},S_{2},S_{3}\succeq0, \end{array} $$ where $y_{i}$ are scalar variables and the matrices $A_{i}$ are symmetric real. How can we rewrite this optimzation problem in the following form $$ \begin{array}{crl} &\underset{y}{\max} & f(y)\\ s.t. & \sum_{i=1}^{m}y_{i}A_{i}+S&=C,\\ &S&\succeq0, \end{array} $$ where $x_{i}$ are scalar variables and the matrices $B_{i}$ are symmetric real. please? Thanks.
2026-03-25 01:15:17.1774401317
How can we rewrite this optimization problem in standard form?
417 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- optimization with strict inequality of variables
- Gradient of Cost Function To Find Matrix Factorization
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Building the model for a Linear Programming Problem
- Maximize the function
- Transform LMI problem into different SDP form
Related Questions in CONVEX-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Check if $\phi$ is convex
- Transform LMI problem into different SDP form
- Can a linear matrix inequality constraint transform to second-order cone constraint(s)?
- Optimality conditions - necessary vs sufficient
- Minimization of a convex quadratic form
- Prove that the objective function of K-means is non convex
- How to solve a linear program without any given data?
- Distance between a point $x \in \mathbb R^2$ and $x_1^2+x_2^2 \le 4$
Related Questions in DUALITY-THEOREMS
- Computing Pontryagin Duals
- How to obtain the dual problem?
- Optimization problem using Fenchel duality theorem
- Deriving the gradient of the Augmented Lagrangian dual
- how to prove that the dual of a matroid satisfies the exchange property?
- Write down the dual LP and show that $y$ is a feasible solution to the dual LP.
- $\mathrm{Hom}(\mathrm{Hom}(G,H),H) \simeq G$?
- Group structure on the dual group of a finite group
- Proving that a map between a normed space and its dual is well defined
- On the Hex/Nash connection game theorem
Related Questions in DISCRETE-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Simultaneously multiple copies of each of a set of substrings of a string.
- Do these special substring sets form a matroid?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- How to solve this binary optimization problem?
- What exactly the Ellipsoid method does?
- Give the cutting-plane proof of $\sum\limits_{i,j = 1}^4 x_{ij} \leq 9$.
- Relation with the perfect partition problem and the single machine task schedule problem
- What is the name of following optimization problem and algorithms to solve them
- Integrality gap of maximum weighted clique
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
First rewrite the problem as $$ \begin{array}{crl} &\underset{y}{\max} & f(y)\\ s.t. & y_{1}A_{1}+y_{2}A_{2}+S_{1}&=C_{1},\\ & y_{3}A_{3}+y_{2}A_{4}+y_{4}A_{5}+S_{2}&=C_{2},\\ & y_{3}A_{6}+y_{4}A_{7}+S_{3}&=C_{3},\\ & S_{1},S_{2},S_{3}\succeq0, \end{array} $$ changing the variable $y_5$ by the variable $y_4$. The three equations that define equality constraints can be written in a single equation using block-partitioned matrices. $$ { \begin{array}{rl} \underset{y}{\max} & f(y)\\ y_1 \left[\begin{array}{ccc} A_1&0&0\\0&0&0\\0&0&0 \end{array}\right] + y_2 \left[\begin{array}{ccc} A_2&0&0\\0&A_4&0\\0&0&0 \end{array}\right] + y_3 \left[\begin{array}{ccc} 0&0&0\\0&A_3&0\\0&0&A_6 \end{array}\right] + y_4 \left[\begin{array}{ccc} 0&0&0\\0&A_5&0\\0&0&A_7 \end{array}\right] + \left[\begin{array}{ccc} S_1&0&0\\0&S_2&0\\0&0&S_3 \end{array}\right] &= \left[\begin{array}{ccc} C_1&0&0\\0&C_2&0\\0&0&C_3 \end{array}\right] \\ \left[\begin{array}{ccc} S_1&0&0\\0&S_2&0\\0&0&S_3 \end{array}\right] &\succeq 0 \end{array} } $$