A smoothing trust-region Newton-CG method for minimax problem

Applied Mathematics and Computation

Volumn 199, Issue 2, 2008, Pages 581-589

  Feng, Ye ^a   Hongwei, Liu ^a   Shuisheng, Zhou ^a   Sanyang, Liu ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Finite minimax problem; Smooth technique; SQP algorithm; Trust region Newton CG algorithm; Unconstrained optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING;

FINITE MINIMAX PROBLEM; UNCONSTRAINED MINIMIZATION;

NEWTON-RAPHSON METHOD;

EID: 42649126009     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.10.070     Document Type: Article

References (22)

1. Polak E. On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Review 29 (1987) 21-89
2. Polak E., Salcudean S., and Mayne D.Q. Adaptive control of ARMA plants using worst-case design by semi-infinite optimization. IEEE Transactions on Automatic Control 32 (1987) 388-397
3. Warren A.D., Lasdon L.S., and Suchman D.F. Optimization in engineering design. Proceedings of the IEEE 55 (1967) 1885-1897
4. Polak E., Higgins J.E., and Mayne D.Q. A barrier function method for minimax problems. Mathematical Programming 64 (1994) 277-294
5. Polak E. Optimization: Algorithms and Consistent Approximations (1997), Springer-Verlag, New York, NY
6. Sussman-Fort S.E. Approximate direct-search minimax circuit optimization. International Journal for Numerical Methods in Engineering 28 (1989) 359-368
7. Rockafellar R.T. Linear-quadric programming and optimal control. SIAM Journal on Control and Optimization 25 (1987) 781-814
8. Rockafellar R.T. Computational schemes for large-scale problems in extended linear quadratic programming. Mathematical Programming 48 (1990) 447-474
9. Higham N.J. Analysis of the Cholesky decomposition of a semi-definite matrix. In: Cox M.G., and Hammarling S. (Eds). Reliable Numerical Computation (1990), Oxford University Press 161-185
10. Polak E., Royset J.O., and Womersley R.S. Algorithms with adaptive smoothing for finite minimax problems. Journal of Optimization Theory and Applications 119 3 (2003) 459-484
11. Zang I. A smoothing technique for min-max optimization. Mathematical Programming 19 (1980) 61-77
12. Charalamous C., and Conn A.R. An efficient method to solve the minimax problem directly. SIAM Journal on Numerical Analysis 15 (1978) 162-187
13. Vardi A. New minimax algorithm. Journal of Optimization Theory and Applications 75 (1992) 613-634
14. Han S.P. Variable metric methods for minimizing a class of nondifferentiable functions. Mathematical Programming 20 (1981) 1-13
15. Osborne M.R., and Watson G.A. An algorithm for minimax approximation in the non-linear case. Computer Journal 12 (1969) 63-68
16. G. Kreisselmeier, R. Steinhauser, Systematic control design by optimization a vector performance index, in: Proc. of IFAC Symp. on CAD of Contr. Syst., 1979, pp. 113-117.
17. Li X. An entropy-based aggregate method for minimax optimization. Engineering Optimization 18 (1997) 277-285
18. Bertsekas D.P. Constrained Optimization and Lagrange Multiplier Methods (1982), Academic Press, New York, NY
19. Pan S.H., and Li X.S. An efficient algorithm for the smallest enclosing ball problem in high dimensions. Applied Mathematics and Computation 172 (2006) 49-61
20. Steihaug T. The conjugate gradient method and trust regions in large scale optimization. SIAM Journal on Numerical Analysis 20 3 (1983) 626-637
21. Nocedal J., and Wright S.J. Numerical Optimization (1999), Springer Science
22. Brayton R.K., Director S.W., Hachtel G.D., and Vidigal L. A new algorithm for statistical circuit design based on quasi-Newton methods and function splitting. IEEE Transactions on Circuits and Systems CAS-26 (1979) 784-794