An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem

Optimization ◽  
2017 ◽  
Vol 67 (3) ◽  
pp. 427-440 ◽  
Author(s):  
Zexian Liu ◽  
Hongwei Liu ◽  
Xiaoliang Dong
2017 ◽  
Vol 2017 ◽  
pp. 1-12
Author(s):  
El-Sayed M. E. Mostafa ◽  
Abdallah W. Aboutahoun ◽  
Fatma F. S. Omar

The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.


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.


2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaomei Zhang ◽  
Yanjun Wang ◽  
Weimin Ma

We present some sufficient global optimality conditions for a special cubic minimization problem with box constraints or binary constraints by extending the global subdifferential approach proposed by V. Jeyakumar et al. (2006). The present conditions generalize the results developed in the work of V. Jeyakumar et al. where a quadratic minimization problem with box constraints or binary constraints was considered. In addition, a special diagonal matrix is constructed, which is used to provide a convenient method for justifying the proposed sufficient conditions. Then, the reformulation of the sufficient conditions follows. It is worth noting that this reformulation is also applicable to the quadratic minimization problem with box or binary constraints considered in the works of V. Jeyakumar et al. (2006) and Y. Wang et al. (2010). Finally some examples demonstrate that our optimality conditions can effectively be used for identifying global minimizers of the certain nonconvex cubic minimization problem.


Sign in / Sign up

Export Citation Format

Share Document