-
1
-
-
0023314734
-
On the mathematical foundations of nondifferentiable optimization in engineering design
-
Polak, E.: On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Rev. 29, 21-89 (1987).
-
(1987)
SIAM Rev.
, vol.29
, pp. 21-89
-
-
Polak, E.1
-
2
-
-
0023345411
-
Adaptive control of ARMA plants using worst case design by semi-infinite optimization
-
Polak, E., Salcudean, S., Mayne, D. Q.: Adaptive control of ARMA plants using worst case design by semi-infinite optimization. IEEE Trans. Autom. Control 32, 388-397 (1987).
-
(1987)
IEEE Trans. Autom. Control
, vol.32
, pp. 388-397
-
-
Polak, E.1
Salcudean, S.2
Mayne, D.Q.3
-
3
-
-
0034228491
-
Portfolio optimization under a minimax rule
-
Cai, X., Teo, K., Yang, X., Zhou, X.: Portfolio optimization under a minimax rule. Manag. Sci. 46(7), 957-972 (2000).
-
(2000)
Manag. Sci.
, vol.46
, Issue.7
, pp. 957-972
-
-
Cai, X.1
Teo, K.2
Yang, X.3
Zhou, X.4
-
5
-
-
0024715561
-
A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
-
Panier, E. R., Tits, A. L.: A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design. IEEE Trans. Autom. Control 34(8), 903-908 (1989).
-
(1989)
IEEE Trans. Autom. Control
, vol.34
, Issue.8
, pp. 903-908
-
-
Panier, E.R.1
Tits, A.L.2
-
6
-
-
0030303851
-
An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions
-
Zhou, J. L., Tits, A. L.: An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM J. Optim. 6(2), 461-487 (1996).
-
(1996)
SIAM J. Optim.
, vol.6
, Issue.2
, pp. 461-487
-
-
Zhou, J.L.1
Tits, A.L.2
-
7
-
-
0344196668
-
Algorithms with adaptive smoothing for finite minimax problems
-
Polak, E., Royset, J. O., Womersley, R. S.: Algorithms with adaptive smoothing for finite minimax problems. J. Optim. Theory Appl. 119(3), 459-484 (2003).
-
(2003)
J. Optim. Theory Appl.
, vol.119
, Issue.3
, pp. 459-484
-
-
Polak, E.1
Royset, J.O.2
Womersley, R.S.3
-
8
-
-
76149137208
-
An interior-point algorithm for nonlinear minimax problems
-
Obasanjo, E., Tzallas-Regas, G., Rustem, B.: An interior-point algorithm for nonlinear minimax problems. J. Optim. Theory Appl. 144, 291-318 (2010).
-
(2010)
J. Optim. Theory Appl.
, vol.144
, pp. 291-318
-
-
Obasanjo, E.1
Tzallas-Regas, G.2
Rustem, B.3
-
9
-
-
61349156172
-
An improved SQP algorithm for solving minimax problems
-
Zhu, Z., Cai, X., Jian, J.: An improved SQP algorithm for solving minimax problems. Appl. Math. Lett. 22(4), 464-469 (2009).
-
(2009)
Appl. Math. Lett.
, vol.22
, Issue.4
, pp. 464-469
-
-
Zhu, Z.1
Cai, X.2
Jian, J.3
-
10
-
-
0347730282
-
A dual and interior-point approach to solve convex min-max problems
-
D. Z. Du and P. M. Pardalos (Eds.), Dordrecht: Kluwer Academic
-
Sturm, J. F., Zhang, S.: A dual and interior-point approach to solve convex min-max problems. In: Du, D. Z., Pardalos, P. M. (eds.) Minimax and Applications, pp. 69-78. Kluwer Academic, Dordrecht (1995).
-
(1995)
Minimax and Applications
, pp. 69-78
-
-
Sturm, J.F.1
Zhang, S.2
-
11
-
-
34548134558
-
Primal interior-point method for large sparse minimax optimization
-
Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic
-
Luksan, L., Matonoha, C., Vlcek, J.: Primal interior-point method for large sparse minimax optimization. Technical Report 941, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic (2005).
-
(2005)
Technical Report 941
-
-
Luksan, L.1
Matonoha, C.2
Vlcek, J.3
-
12
-
-
42649126009
-
A smoothing trust-region Newton-CG method for minimax problem
-
Ye, F., Liu, H., Zhou, S., Liu, S.: A smoothing trust-region Newton-CG method for minimax problem. Appl. Math. Comput. 199(2), 581-589 (2008).
-
(2008)
Appl. Math. Comput.
, vol.199
, Issue.2
, pp. 581-589
-
-
Ye, F.1
Liu, H.2
Zhou, S.3
Liu, S.4
-
13
-
-
46249117219
-
An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
-
Polak, E., Womersley, R. S., Yin, H. X.: An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems. J. Optim. Theory Appl. 138, 311-328 (2008).
-
(2008)
J. Optim. Theory Appl.
, vol.138
, pp. 311-328
-
-
Polak, E.1
Womersley, R.S.2
Yin, H.X.3
-
14
-
-
84953019372
-
An entropy-based aggregate method for minimax optimization
-
Li, X.: An entropy-based aggregate method for minimax optimization. Eng. Optim. 18, 277-285 (1992).
-
(1992)
Eng. Optim.
, vol.18
, pp. 277-285
-
-
Li, X.1
-
15
-
-
0035546518
-
Smoothing method for minimax problems
-
Xu, S.: Smoothing method for minimax problems. Comput. Optim. Appl. 20, 267-279 (2001).
-
(2001)
Comput. Optim. Appl.
, vol.20
, pp. 267-279
-
-
Xu, S.1
-
18
-
-
0023399684
-
On the complexity of the exchange algorithm for minimax optimization problems
-
Drezner, Z.: On the complexity of the exchange algorithm for minimax optimization problems. Math. Program. 38(2), 219-222 (1987).
-
(1987)
Math. Program.
, vol.38
, Issue.2
, pp. 219-222
-
-
Drezner, Z.1
-
19
-
-
0026237395
-
On the rate of convergence of two minimax algorithms
-
Wiest, E. J., Polak, E.: On the rate of convergence of two minimax algorithms. J. Optim. Theory Appl. 71(1), 1-30 (1991).
-
(1991)
J. Optim. Theory Appl.
, vol.71
, Issue.1
, pp. 1-30
-
-
Wiest, E.J.1
Polak, E.2
-
20
-
-
0029338609
-
Complexity estimates of some cutting plane methods based on the analytic barrier
-
Nesterov, Yu.: Complexity estimates of some cutting plane methods based on the analytic barrier. Math. Program. 69(1), 149-176 (1995).
-
(1995)
Math. Program.
, vol.69
, Issue.1
, pp. 149-176
-
-
Nesterov, Y.1
-
21
-
-
0034348640
-
On complexity of the translational-cut algorithm for convex minimax problems
-
Ariyawansa, K. A., Jiang, P. L.: On complexity of the translational-cut algorithm for convex minimax problems. J. Optim. Theory Appl. 107(2), 223-243 (2000).
-
(2000)
J. Optim. Theory Appl.
, vol.107
, Issue.2
, pp. 223-243
-
-
Ariyawansa, K.A.1
Jiang, P.L.2
-
22
-
-
21044446526
-
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
-
Nesterov, Yu., Vial, J. Ph.: Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. Math. Program. 99(1), 149-174 (2004).
-
(2004)
Math. Program.
, vol.99
, Issue.1
, pp. 149-174
-
-
Nesterov, Y.1
Vial, J.P.2
-
27
-
-
0024665753
-
Interior path following primal-dual algorithms. Part II: Convex quadratic programming
-
Monteiro, R. D. C., Adler, I.: Interior path following primal-dual algorithms. Part II: Convex quadratic programming. Math. Program. 44(1), 43-66 (1989).
-
(1989)
Math. Program.
, vol.44
, Issue.1
, pp. 43-66
-
-
Monteiro, R.D.C.1
Adler, I.2
-
29
-
-
3843088446
-
Smoothing techniques for the solution of finite and semi-infinite min-max-min problems
-
G. D. Pillo and A. Murli (Eds.), Dordrecht: Kluwer Academic
-
Polak, E.: Smoothing techniques for the solution of finite and semi-infinite min-max-min problems. In: Pillo, G. D., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization. Kluwer Academic, Dordrecht (2003).
-
(2003)
High Performance Algorithms and Software for Nonlinear Optimization
-
-
Polak, E.1
-
30
-
-
46249128581
-
On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy
-
Polak, E.: On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy. J. Optim. Theory Appl. 138(2), 305-309 (2008).
-
(2008)
J. Optim. Theory Appl.
, vol.138
, Issue.2
, pp. 305-309
-
-
Polak, E.1
-
31
-
-
79952247026
-
Mathworks Inc.: MATLAB 7 Getting Started Guide
-
Mathworks Inc.: MATLAB 7 Getting Started Guide. Natick, MA (2009).
-
(2009)
Natick, MA
-
-
-
32
-
-
79952251480
-
Tomlab Optimization Inc.: User's Guide for TOMLAB/CPLEX v12. 1
-
Tomlab Optimization Inc.: User's Guide for TOMLAB/CPLEX v12. 1. Pullman, WA (2009).
-
(2009)
Pullman, WA
-
-
-
33
-
-
84909874286
-
User's Guide for LSSOL (Version 1. 0): A Fortran Package for Constrained Linear Least-Squares and Convex Quadratic Programming
-
Gill, P. E., Hammarling, S. J., Murray, W., Saunders, M. A., Wright, M. H.: User's Guide for LSSOL (Version 1. 0): A Fortran Package for Constrained Linear Least-Squares and Convex Quadratic Programming. Stanford, CA (1986).
-
(1986)
Stanford, CA
-
-
Gill, P.E.1
Hammarling, S.J.2
Murray, W.3
Saunders, M.A.4
Wright, M.H.5
-
34
-
-
0003997741
-
User's Guide for CFSQP Version 2. 5: A C Code for Solving (Large Scale) Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints
-
Lawrence, C., Zhou, J. L., Tits, A. L.: User's Guide for CFSQP Version 2. 5: A C Code for Solving (Large Scale) Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints. Technical Report (1997).
-
(1997)
Technical Report
-
-
Lawrence, C.1
Zhou, J.L.2
Tits, A.L.3
-
36
-
-
61349129045
-
A superlinearly convergent sequential quadratic programming algorithm for minimax problems
-
Zhu, Z., Zhang, K.: A superlinearly convergent sequential quadratic programming algorithm for minimax problems. Chin. J. Numer. Math. Appl. 27(4), 15-32 (2005).
-
(2005)
Chin. J. Numer. Math. Appl.
, vol.27
, Issue.4
, pp. 15-32
-
-
Zhu, Z.1
Zhang, K.2
|