Preview
Unable to display preview. Download preview PDF.
References
D.D. Morrison, Optimization by least squares, SIAM J. Numer. Analysis, 5 (1968), 83–88.
Yu.P. Ivanilov, Two algorithms for solving a convex programming problem, In: Theory of Optimal Decisions 4, Kiev, Cybernetics Institute of the UkrSSR Academy of Sciences, 1969, 13–21 (in Russian).
J. Kowalik, M.R. Osborn and D.M. Ryan, A new method for constrained optimization problems, Operat. Res., 17 (1969) 6, 973–989.
K. Grossman and A.A. Kaplan, Non-linear programming on the basis of unconstrained minimization, Nayka, Novosibirsk 1982 (in Russian).
P. Huard, A method of centres by upper-bounding functions with applications, In: Non-linear programming, Academic Press New York, 1970, pp. 1–30.
V.G. Zhadan, A method for parametric representation of objective functions in conditional multicriterial optimization. U.S.S.R. Comput. Maths. Math. Phys., 26 (1986), 108–115.
Yu.G. Evtushenko and V.G. Zhadan, Exact auxiliary functions in optimization problems, Journal of Comput. Maths. and Math. Phys. 30 (1990), 43–57 (in Russian).
Yu.G. Evtushenko and V.G. Zhadan, Systematization of nonlinear programming methods. Sequential unconstrained minimization techniques, Reports on Appl. Math., Computing Center of the USSR Academy of Sciences, 1988 (in Russian).
M. Iri and H. Imai, A Multiplicative Barrier Function Method for Linear Programming, Algorithmica, 1 (1986), 455–482.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 International Federation for Information Processing
About this paper
Cite this paper
Zhadan, V.G. (1990). Methods of centers in nonlinear programming. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008375
Download citation
DOI: https://doi.org/10.1007/BFb0008375
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52659-9
Online ISBN: 978-3-540-47095-3
eBook Packages: Springer Book Archive