Questions tagged [optimization]

Optimization is the process of choosing the "best" value among possible values. They are often formulated as questions on the minimization/maximization of functions, with or without constraints.

In mathematics, computer science, economics, or management science, mathematical optimization (alternatively, optimization or mathematical programming) is the selection of a best element (with regard to some criteria) from some set of available alternatives.

An optimization problem can be represented in the following way: given a function $f:A\to\mathbb{R}$ from some set $A$ to the real numbers, we want to find an element $x_0\in A$ such that $f(x_0)\le f(x)$ for all $x \in A$ ("minimization") or such that $f(x_0)\ge f(x)$ for all $x \in A$ ("maximization").

22512 questions
0
votes
0 answers

What kind of optimization problem is this? Is it a valid problem at all?

minimize $-r_1*r_2*...*r_n$ Equation constraint: $x_1^2/r_1^2 +... + x_n^2/r_n^2=1$ m nonlinear inequality constraint : $f_i(x_1,...,x_n) \geq 0$ $i=1,...,m$ I want to find the ellipsoid with maximal volume. The constraints limit the size of the…
0
votes
1 answer

What is the meaning of D(x,l) or D(x,f(x)) in here?

I was reading this paper https://arxiv.org/pdf/1312.6199.pdf and I couldn't understand what D(x,l) means. My interpretation of the objective function is as follows. r : noise x : image l : label Minimize the noisy image r such that its addition to…
Kong
  • 884
0
votes
1 answer

Second partial derivative test failing when Determinant is 0

I am studying the second partial derivative test and it says when determinant of the hessian matrix is $0$ then there is no conclusion. However I saw on a website a method that tells you how to workout what kind of point is the one with zero…
0
votes
1 answer

Optimization-Cost function

I consider the cost function given by $$ TC=q_1 +kq_2 $$ $ k\in(0,1). $ Demand functions are given by $ $$ q_1(p_1,p_2)=q_2(p_1,p_2)=(p_1p_2)^{-3}, p_1>0, p_2>0 $$ I need to find optimal values for prices and find the values of k for which one…
0
votes
1 answer

Finding Parameters to Minimize a Maximum of Multiple Functions

I want to find the parameters $a$ $(1/2
Pooya
  • 27
0
votes
1 answer

Necessary and enough condition for minimum of function

Let $F(x)=〈Ax,x〉+〈2b,x〉+c, x\in\mathbb R^n$, A is real, symmetric, regular and positive definite matrix, $a,b\in\mathbb R^n$, $c\in\mathbb R$ are fixed. What is necessary condition for local minimum of F? Is enough condition satisfied too? I know…
gorica
  • 15
  • 2
0
votes
0 answers

CLP optimization package

I just want to implement an optimization problem with CLP ( it solves the linear program), but I haven't found any documents about how can implement an optimization problem by CLP. Does there exist any person to help me to solve my problem? Thanks
0
votes
1 answer

Optimizing linear combination of logarithmic functions

I would like to be directed to the proper literature regarding the following problem: Given a constant sum of $x_n$ values: $\sum_{n=1}^{N}{\left. {x_n}\right.} = C$ where $x_n ≥ 1$ Find the maximum of the following…
0
votes
1 answer

$\sup\limits_{\|w\|_p \leq 1} w^Ta = \|a\|_q$?

Is $\sup\limits_{\|w\|_p \leq 1} w^Ta = \|a\|_q$ ? Can anyone tell me how to prove it use the Lagrangian multiplier method? $\frac1q +\frac1p = 1 ,~p,q>1$.
coolcat
  • 409
0
votes
1 answer

Is it possible to convert system of linear equations to transportation problem?

I was just wondering this while studying optimization methods. But I dont know how to define a transportation network. I want to do this for arbitrary matrix. Any ideas?
0
votes
0 answers

How would I minimise this sum?

The sum I would like to minimise is $$f(a)= \sum^n_i a_i\log_2 a_i $$ on the constraint that $a_i \in (0,1]$. If I take the gradient of this function with respect to each $a_i$ I obtain $$a_i=e^{-1}.$$ This problem stems from not being able to…
user557590
0
votes
1 answer

Feasible direction set for KKT conditions

Consider the following minimization problem, $$\min_{x\in \mathbb{R}^2} (x_1-x_2^2) \text{ subject to } -x_1^2-x_2^2+2x_1\geq 0.$$ I am asked to find "feasible directions" from the point $(x_1,x_2)=(0,0).$ That is, directions along which the…
Dman
  • 345
  • 1
  • 6
0
votes
1 answer

How to approach this minmax problem (nonconvex)

This is my first time to solve the minmax problem, I also read the following discussion: How to approach a minmax problem? My problem is \begin{equation} \begin{aligned} & {\underset{w_i,\ \ \ \ \ x_i}{\max\min}} & &…
sleeve chen
  • 8,281
0
votes
1 answer

Maximizing function in 2 variables with constraint in 3

\begin{gather*} \max &{3x_1-x_2+x_2^3} \\ s.t. &x_1+x_2+x_3 \leq 0 \\ &-x_1+2x_2+x_3^2=0 \end{gather*} I calculated the partial derivatives: $$\frac{\partial f}{\partial x_1}= 3$$ $$\frac{\partial f}{\partial x_2}=…
0
votes
1 answer

Maximizing two variables

If I wanted to maximize two variables can I just rank the two variables from the sample as a point system and then sum the points? I know this probably isn't the most mathematically correct way. For example, if I have an average and a variance for…