A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem

2013 ◽  
Vol 39 ◽  
pp. 1-11 ◽  
Author(s):  
Chuangyin Dang ◽  
Jianqing Liang ◽  
Yang Yang
SIAM Review ◽  
2020 ◽  
Vol 62 (2) ◽  
pp. 395-436
Author(s):  
Yair Carmon ◽  
John C. Duchi

2007 ◽  
Vol 62 (1) ◽  
pp. 84-100 ◽  
Author(s):  
Xu-Lei Yang ◽  
Qing Song ◽  
Yi-Lei Wu

2005 ◽  
Vol 15 (08) ◽  
pp. 1181-1202 ◽  
Author(s):  
PHILIPPE G. CIARLET ◽  
LILIANA GRATIE

We propose a new approach to the existence theory for quadratic minimization problems that arise in linear shell theory. The novelty consists in considering the linearized change of metric and change of curvature tensors as the new unknowns, instead of the displacement vector field as is customary. Such an approach naturally yields a constrained minimization problem, the constraints being ad hoc compatibility relations that these new unknowns must satisfy in order that they indeed correspond to a displacement vector field. Our major objective is thus to specify and justify such compatibility relations in appropriate function spaces. Interestingly, this result provides as a corollary a new proof of Korn's inequality on a surface. While the classical proof of this fundamental inequality essentially relies on a basic lemma of J. L. Lions, the keystone in the proposed approach is instead an appropriate weak version of a classical theorem of Poincaré. The existence of a solution to the above constrained minimization problem is then established, also providing as a simple corollary a new existence proof for the original quadratic minimization problem.


Sign in / Sign up

Export Citation Format

Share Document