Nonlinear coordinate representations of smooth optimization problems

作者: T. Rapcsák , T. T. Thang

DOI: 10.1007/BF02192090

关键词:

摘要: Nonlinear coordinate representations of smooth optimization problems are investigated from the point view variable metric algorithms. In other words, nonlinear systems, in sense differential geometry, studied by taking into consideration structure and methods. Both unconstrained constrained cases discussed. The present approach is based on fact that transformation an problem can be replaced a suitable Riemannian belonging to Euclidean class. case equality inequality constraints, these questions related closely right inverses full-rank matrices; therefore, their characterization starting analysis. main results concern new subclass transformations connection with common supply coordinates two manifolds, one immersed one. This situation corresponds differentiable manifold improves insight theoretical background For wide class methods, convergence theorem invariant form (not depending representations) proved. Finally, convexification image studied.

参考文章(34)
T. Rapcsák, Geodesic convexity in nonlinear optimization Journal of Optimization Theory and Applications. ,vol. 69, pp. 169- 183 ,(1991) , 10.1007/BF00940467
Jean Pierre Aubin, Explicit methods of optimization ,(1984)
Marshall Carleton Pease III., Methods of Matrix Algebra ,(1965)
Klaus Deimling, Nonlinear functional analysis Dover Publications. ,(1985) , 10.1007/978-3-662-00547-7
Jacob T. Schwartz, Nonlinear functional analysis Courant Institute of Mathematical Science, New York University. ,(1965)
D. A. Bayer, J. C. Lagarias, The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories Transactions of the American Mathematical Society. ,vol. 314, pp. 499- 526 ,(1989) , 10.1090/S0002-9947-1989-1005525-6
Michael J. Best, Equivalence of some quadratic programming algorithms Mathematical Programming. ,vol. 30, pp. 71- 87 ,(1984) , 10.1007/BF02591799
Tam�s Rapcs�k, Tibor Csendes, Nonlinear coordinate transformations for unconstrained optimization II. Theoretical background Journal of Global Optimization. ,vol. 3, pp. 359- 375 ,(1993) , 10.1007/BF01096776
D. Den Hertog, C. Roos, T. Terlaky, On the classical logarithmic barrier function method for a class of smooth convex programming problems Journal of Optimization Theory and Applications. ,vol. 73, pp. 1- 25 ,(1992) , 10.1007/BF00940075
T. Rapcsák, T. T. Thang, A class of polynomial variable metric algorithms for linear optimization Mathematical Programming. ,vol. 74, pp. 319- 331 ,(1996) , 10.1007/BF02592202