# Tagged Questions

The tag has no usage guidance.

0answers
24 views

### Multi-objective optimization for large matrices

I have a large matrix 102400 x 600 to optimize for two different criteria (maximum likelihood over a large dataset and another more complicated one). In practice, it represents a factors loading ...
0answers
52 views

### deriving concave upper bounds of a domain constrained nonconvex function over a simplex

Consider a nonconvex function $h(X)=f(X^\dagger AX)$, where $X\in C^{r \times n}$, $A$ is a positive semidefinite matrix, and $f$ satisfies the following two properties: \begin{align} &f(W): H_{+}^...
0answers
27 views

### Difference between Chebyshev first and second degree iterative methods

Consider linear equation $Au = f$. We want to solve it with iterative method (assuming $A$ is good). First order iterative method is: $$u^{k+1} = u^k - \alpha_{k+1}(Au^k - f),$$ The second degree ...
0answers
28 views

### About a particular definition of a Hessian of a function of tuples of matrices

Say I have a function $L : (W_1,..,W_{H+1}) \rightarrow \mathbb{R}$ i.e it takes a tuple of $n$ matrices of different dimensions and computes a number from them. Then I see being defined a ...
1answer
30 views

### Limits of argmin ratios and sums

In my research on convergence properties of certain Bayesian methods I have encountered $\mathop{\mathrm{arg\,min}}$ limits of the forms \lim_{n\to\infty} \mathop{\mathrm{arg\,min}}_{\...
0answers
67 views

### Characterizing the optimimum over the space of probability measures

Consider the following optimization problem: $$\max_{\mu \in \mathcal{M}} \int \log\left( \int e^{\alpha U(x,y)} d\mu(y) \right) d\nu(x)$$ where $\mathcal{M}$ is the space ...
5answers
1k views

### Robust black box function minimization with extremely expensive cost function

There is an enormous amount of information about the common applied math problem of minimizing a function.. software packages, hundreds of books, research, etc. But I still have not found a good ...
0answers
41 views

### Limit of argmin of sum

Suppose that I know $f_n\rightarrow f$ and $g_n\rightarrow g$ are both continuous maps from a Complete Riemmanian Manifold $X$ to $\mathbb{R}$ which converge pointwise almost everywhere. Then is it ...
0answers
43 views

### Largest instance of highly nonlinear benchmark functions (e.g. Rastrigin function)

What is the largest instance size (number of variables) ever numerically solved for highly nonlinear (continuous, not combinatorial) optimization benchmarks functions, such as Rastrigin, Schwefel or ...
0answers
31 views

### Dennis More' Superlinear Convergence_refrences request

Why in the proof of superlinear convergence of restricted broyden class (for the unconstrained optimization) we need the bounded deterioration condition for the approximation of all the true hessian ...
2answers
266 views

1answer
112 views

### Convert general optimization problem to LP problem

I am trying to convert the following problem into a linear programming problem: There are $M\times N$ matrix $T$ of real numbers between 0 and 1 and $N\times 1$ vector $w$ of real numbers between 0 ...
0answers
52 views

### Separable Least squares - is there a notion of conjugate directions?

I have a general question. Suppose I have the following to optimize $$\|Y-A(\mathbf{x})B(\mathbf{y})\|^2$$ where $Y$ is a vector, $A(\mathbf{x})$ is a matrix that depends on a vector $\mathbf{x}$ in a ...
1answer
88 views

### Optimization of a function of a positive definite matrix and its inverse

This question is a little ill-posed, but I've been playing with some equations and am just wondering if this resembles any known problems that have been solved. Suppose I have two real, positive ...
2answers
197 views

### Maximal minimum for a sum of two (or more) cosines

Please prove (or disprove, and give the correct answer): $$2 =\mathrm{argmax}_{r\geq 1}\min_{x\in \mathbb{R}}\left[\cos\left(x\right)+\cos\left(rx\right)\right]$$ In other words, find $r \geq 1$, ...
2answers
99 views

### Is finding a local minimizer of a NP-hard optimization problem is still NP-hard [closed]

I was wondering if for a NP-hard optimization problem, I only want to find its local minimizer, is it still NP-hard or NP-hard is only true when trying to find a global minimizer?
0answers
21 views

### Deterministic global solution to find the Optimal-knot placements for continuous piecewise linear functions to fit nonlinear data

I have been searching lately for a deterministic global technique to linearize a nonlinear function with continuous piecewise linear regions. I've a univariate nonlinear function y=f(x). where f(x) ...
0answers
33 views

1answer
56 views

### Two fold optimization: is there an established approach for this kind of problem?

I have a list of thousands of linear expressions, with less than 100 total variables. Each expression is associated with a positive point value. I want to make as many of the expressions greater than ...
0answers
130 views

### Optimization over space of probability measures

Consider an optimization problem as follows: $$\min\mathbb E_w[f_0(w)] \mathrm{\,\,\,\,\,\ s.t.\,\,\,\,} E_w[f_i(w)]\leq 0 ,\,\,\, i=1,\dots, k$$ where the maximum is taken over $\mathscr M$, ...
0answers
211 views

### maximize non-convex composite function

I want to maximize a composite function over a convex set \begin{aligned} & \underset{\mathbf{p}}{\text{maximize}} & & f(\mathbf{p})-g(\mathbf{p})\\ & \text{subject to}...
0answers
77 views

0answers
121 views

0answers
48 views

### Changing a nonlinear equality constraint into some conic inequality plus rank constraint

If we have a constraint optimization problem in which one of our constraint is $\prod\limits_{k = 1}^N {\left( {x - {a_k}} \right) = 0}$ . How could this nonlinear equality condition be changed into ...