Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options questions only not deleted user 27249

Optimization with convex constraints and convex objectives; notions related to convex optimization such as sub-gradients, normal cones, separating hyperplanes

3 votes
1 answer
239 views

A difficult combinatorial optimization problem

Let $\mathcal{J}$ be a closed, bounded, compact, convex set in $\mathbb{R}^L$. (Notations: vector $\mathbf{x}$ is denoted in bold letters and its $i^{th}$ co-ordinate is denoted as $x_i$. $\mid\math …
dineshdileep's user avatar
  • 1,421
0 votes
1 answer
314 views

Sub optimal algorithm for linear programming

Consider the linear programming problem \begin{align} f^* = \max_{x}&~p^Tx~\\~&A^Tx\leq b~,~0\leq x_i\leq 1 \end{align}where $c$ is a $n\times 1 $ vector, $A$ is a $n\times c$ matrix and $b$ is a $c \ …
dineshdileep's user avatar
  • 1,421
3 votes
1 answer
782 views

Maximum of sum of exponential function

Let $x_1,\dots,x_n$ be a set of given vectors in $\mathbb{R}_{+}^d$. Let $c_1,\dots,c_n$ be given positive constants. I am interested in finding the vectors $w_1,\dots,w_n$ in $\mathbb{R}_{+}^d$ that …
dineshdileep's user avatar
  • 1,421
1 vote
2 answers
229 views

Feasibility of a given set of homogenuous nonconvex quadratic inequality constraints

Let $C_1$,$C_2$,...$C_N$ be $M \times M$ indefinite hermitian matrices. What can we say about the following quadratic constriants \begin{align} w^{H}C_1w>0 \\\ w^{H}C_2w>0 \\\ ...~~~~~~~~~~ \\\ ...~~~ …
dineshdileep's user avatar
  • 1,421
1 vote
1 answer
510 views

Semidefinite relaxation for a quadratic feasibility problem using CVX

The following decides the feasibility of a semidefinite program (SDP) \begin{align} \max_{\mathbf{Z}}~0 \\\ \mathrm{trace}(\mathbf{Z})\leq \rho \\\ \mathrm{trace}(\mathbf{S}_1\mathbf{Z}) \geq \alpha …
dineshdileep's user avatar
  • 1,421
4 votes
2 answers
358 views

A certain type of constrained Rayleigh-Ritz ratio

Let $\mathbf{A_1}$ and $\mathbf{A_2}$ be two hermitian matrices. Consider the problem \begin{align} \max_{\mathbf{u}^H\mathbf{u}=1}~\mathbf{u}^H\mathbf{A}_1\mathbf{u} \\\ \mathbf{u}^H\mathbf{A}_2\math …
dineshdileep's user avatar
  • 1,421
8 votes
3 answers
2k views

Optimization problem with determinant as objective

Let $A$ be a given symmetric positive definite $N\times N$ matrix. I need to find a symmetric positive semi-definite matrix $S$ which is the solution to the following optimization problem \begin{align …
dineshdileep's user avatar
  • 1,421
1 vote
2 answers
601 views

Maximizing a sum of Gaussians

Let $\mathbf{x}_1, \dots, \mathbf{x}_n \in \mathbb{R}^d$ be $n$ given vectors. Define the function $$ \mathcal{K}(\mathbf{x},\mathbf{y}) := \alpha\exp\left(-\frac{\|\mathbf{x}-\mathbf{y}\|^2}{2\sigma^ …
dineshdileep's user avatar
  • 1,421
2 votes
0 answers
46 views

Notion of distance between linear programs

Consider the linear programming problem \begin{align} \max_{x}&~c^Tx \\~s.t.~~a^Tx &\leq B~,~0\leq x_i \le1 \end{align} where $c$ and $a$ are $n \times 1$ given non-negative vectors. $B$ is a positive …
dineshdileep's user avatar
  • 1,421
3 votes
1 answer
2k views

Fast algorithm for maximizing smallest eigenvalue of linear combination of hermitian matrices

I have an engineering back ground. Due to work, I came across this problem \begin{align} &\max_{\lambda,y_i\in \mathbb{R}}~\lambda \\\ s.t.~&\left(\mathbf{A}_0+\sum_{i=1}^{K}y_i\mathbf{A}_i\right)-\ …
dineshdileep's user avatar
  • 1,421
0 votes
1 answer
198 views

Eigenvalues of a given parametrized matrix.

Let $\mathbf{A}$ and $\mathbf{B}$ be two complex rank-one $N\times N$ positive semi-definite matrices. Let the matrix $\mathbf{C}$ be defined as \begin{align} \mathbf{C}=\left(\mathbf{I}*\frac{1}{\alp …
dineshdileep's user avatar
  • 1,421
2 votes
1 answer
1k views

Subgradient of Minimum Eigenvalue

Consider three $N \times N$ Hermitian matrices $A_0$, $A_1$, $A_2$. Consider the function \begin{align} f(t_1,t_2)=\lambda_{\text{min}}(A_0+t_1A_1+t_2A_2) \end{align} where $\lambda_{\text{min}}$ deno …
dineshdileep's user avatar
  • 1,421
4 votes
2 answers
599 views

A certain type of quadratic constrained quadratic program (QCQP)

Let $P_1$, $P_2$ be two Hermitian matrices. Can anyone comment on the following QCQP? $$\begin{array}{ll} \text{minimize} & z^{H} z\\ \text{subject to} & z^{H} P_1 z +1 \leq 0\\ & z^{H} P_2 z + 1 \le …
dineshdileep's user avatar
  • 1,421