A study of minimizing sequences

This paper poses optimization problems as problems on sequences in an extended normed space, and derives first and second order optimality conditions for them.

[1]  E. Polak,et al.  Computational methods in optimization : a unified approach , 1972 .

[2]  P. Wolfe,et al.  The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices , 1975 .

[3]  D. Mayne,et al.  On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems , 1983 .

[4]  John W. Bandler,et al.  A nonlinear programming approach to optimal design centering, tolerancing, and tuning , 1976 .

[5]  E. Polak,et al.  A Nondifferentiable Optimization Algorithm for the Design of Control Systems Subject to Singular Value Inequalities Over a Frequency Range , 1981 .

[6]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[7]  Edward J. Haug,et al.  Design Sensitivity Analysis in Structural Mechanics.II. Eigenvalue Variations , 1980 .

[8]  Elijah Polak,et al.  On the rate of convergence of certain methods of centers , 1972, Math. Program..

[9]  D. Mayne,et al.  First-order strong variation algorithms for optimal control , 1975 .

[10]  Elijah Polak,et al.  Nondifferentiable optimization algorithm for designing control systems having singular value inequalities , 1982, Autom..

[11]  E. Polak,et al.  Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem , 1979 .

[12]  David Q. Mayne,et al.  Combined phase I—phase II methods of feasible directions , 1979, Math. Program..

[13]  F. Clarke.  Generalized gradients and applications , 1975 .

[14]  E. Polak,et al.  Relaxed Controls and the Convergence of Optimal Control Algorithms , 1976 .