Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization

@article{HiriartUrruty2007PotpourriOC,
  title={Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization},
  author={Jean-Baptiste Hiriart-Urruty},
  journal={SIAM Rev.},
  year={2007},
  volume={49},
  pages={255-273}
}
We present a collection of fourteen conjectures and open problems in the fields of nonlinear analysis and optimization. These problems can be classified into three groups: problems of pure mathematical interest, problems motivated by scientific computing and applications, and problems whose solutions are known but for which we would like to know better proofs. For each problem we provide a succinct presentation, a list of appropriate references, and a view of the state of the art of the subject… 

Figures from this paper

A new series of conjectures and open questions in optimization and matrix analysis

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper (J.-B. Hiriart- Urruty,

On two questions of optimization theory concerning quadratic mappings

TLDR
This paper presents solutions of two open problems from the theory of quadratic mappings arising from the optimization theory and formulated by Hiriart-Urruty with respect to the non-triviality and the positivity of the maximum of finitely many of Quadratic forms.

Connectedness and solarity in problems of best and near-best approximation

This survey is concerned with structural characteristics of `suns' in normed linear spaces, with special emphasis on connectedness and monotone path-connectedness. Consideration is given to both

Two problems of the theory of quadratic maps

Given quadratic forms q1, …, qk, two questions are studied: Under what conditions does the set of common zeros of these quadratic forms consist of the only point x = 0? When is the maximum of these

Connectivity of Quadratic Hypersurfaces and Its Applications in Optimization, Part I: General Theory

TLDR
A basic theory on the connectivity of quadratic hypersurfaces is established and several connectivity theorems on quadratics functions that combine and generalize Dines's and Brickman's results on the hidden convexity of Quadratic mappings in real field are proved.

University of Birmingham An approximation theory of matrix rank minimization and its applications to quadratic equations

TLDR
It is proved that a rank minimization problem can be approximated to any level of accuracy via continuous optimization (especially, linear and nonlinear semidefinite programming) problems.

Simultaneous Diagonalization via congruence of matrices and some applications in optimization

Simultaneous diagonalization via congruence (SDC) of matrices has been a long standing problem [Potpourri of conjectures and open questions in nonlinear analysis and optimization, SIAM Rev., 49

Equivalent conditions for simultaneous diagonalization via *-congruence of Hermitian matrices

This paper aims at giving some equivalent conditions for that a collection of finitely many of Hermitian matrices can be simultaneously diagonalizable via congruence (SDC) by a nonsingular matrix. It

Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations

Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

F. Santos’ work is a solid survey-paper on a topic that I would cover with the following keywords: polyhedra, linear programming, graph theory. First of all, I must confess that I like to read (and,
...

References

SHOWING 1-10 OF 47 REFERENCES

CHARACTERIZATION OF CHEEGER SETS FOR CONVEX SUBSETS OF THE PLANE

Given a planar convex domain Q, its Cheeger set CΩ is defined as the unique minimizer of |∂X|/|(X| among all nonempty open and simply connected subsets X of Ω. We prove an interesting geometric

Matrix analysis

TLDR
This new edition of the acclaimed text presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications.

ENSEMBLES DE TCHEBYCHEV VS ENSEMBLES CONVEXES : L'ETAT DE LA SITUATION VU VIA L'ANALYSE CONVEXE NON LISSE

A closed setS of a Hilbert spaceH is said to be Tchebychev if every point inH has one and only one closest point in S. Is such a set necessarily convex? This question, one of the most famous in

GENERALIZED SOLUTIONS OF THE HAMILTON-JACOBI EQUATIONS OF EIKONAL TYPE. I. FORMULATION OF THE PROBLEMS; EXISTENCE, UNIQUENESS AND STABILITY THEOREMS; SOME PROPERTIES OF THE SOLUTIONS

A nonlocal theory of boundary value problems in bounded and unbounded domains is constructed for nonlinear equations of first order of the type of the classical eikonal equation in geometric optics

The problem of convexity of Chebyshev sets

Contents Introduction §1. Definitions and notation §2. Reference theorems §3. Some results Chapter I. Characterization of Banach spaces by means of the relations between approximation properties of

Convex analysis and minimization algorithms

IX. Inner Construction of the Subdifferential.- X. Conjugacy in Convex Analysis.- XI. Approximate Subdifferentials of Convex Functions.- XII. Abstract Duality for Practitioners.- XIII. Methods of

Permanently Going Back and Forth between the ``Quadratic World'' and the ``Convexity World'' in Optimization

TLDR
A review of different results concerning convexity of images by quadratic mappings, putting them in a chronological perspective and enlighten these results from a geometrical point of view in order to provide new and comprehensive proofs.

On a subproblem of trust region algorithms for constrained optimization

TLDR
It is proved that the Hessian of the Lagrangian has at most one negative eigenvalue, and an example is presented to show thatThe Hessian may have a negative eigensvalue when one constraint is inactive at the solution.