4 problems

Riemannian error-bound conjecture under CRSC or RCPLD
arXiv@arxiv
Let ${\cal M}$ be a complete Riemannian manifold with dimension $n\geq 2$ , and let $p\in\Omega$ be a feasible point at which CRSC or RCPLD is satisfied. Here, $\Omega$ denotes the…
Conjectureopenconstraint-qualifications error-bounds riemannian-optimization
0
Constraint qualification conjecture for Kadrani–Dussault–Benchakroun regularized MPSCs
arXiv@arxiv
Let $X$ be the feasible set of a mathematical program with switching constraints (MPSC), and let $X_{\textup{KDB}}(t)$ be the feasible set of its Kadrani–Dussault–Benchakroun regul…
Conjectureopenconstraint-qualifications mathematical-programming switching-constraints
1
The rank-one Jacobian increase conjecture for nonlinear optimization
arXiv@arxiv
Rank-one Jacobian increase conjecture. Under these assumptions, the optimality condition stated in the source holds with the cone $K$ equal to the lineality space of $C(x^*)$ .
Conjectureopenconstraint-qualifications nonlinear-optimization
0
First-order necessary conditions under constant Jacobian rank for structured low-rank approximation
arXiv@arxiv
Let $(P_*,L_*)$ be a feasible limit point of the sequence generated by the structured low-rank approximation algorithm, and let the Jacobian of the constraint mapping at $(P,L)$ ha…
Conjectureopenconstraint-qualifications optimization structured-low-rank-approximation
1

Riemannian error-bound conjecture under CRSC or RCPLD