Abstract
A function is said to be on exact auxiliary function (EAP). if the set of global minimizers of this function coincides with the global solution set of initial optimization problem. Sufficient conditions for exact equivalence of constrained minimization problem and minimization of EAP are provided. Paper presents two classes of EAP for a nonlinear programming problem without assumption that the problem has a saddle point of Lagrange function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsekas, D.P. (1975). Necessary and sufficient oonditions for a penalty method to be exaot. Math. Program., 9, 87–99.
Bertsekas, D.P.(1982). Constrained Optimization and Lagrange Multiplier Methods. Aoademio Press, New York.
Di Pillo G., and L. Grippo (1985). A continuously differentiable exaot penalty function for nonlinear programming problems with inequality constraints. SIAM J. Control and Optimization, 23, 1, 72–84.
Di Pillo G., and L. Grippo (1989). Exact penalty functions in constrained optimization. SIAM J. Control and Optimization, 27, 6, 1333–1360.
Eremin, I.I. (1967). The method of penalties in convex programming. Dool. Acad. Nauk SSSR, 173, 4, 748–751 (in Russian).
Evtushenko, Yu.G. (1987). Accuracy estimations for penalty function methods. Problem of applied mathematics and computer science, Nauka, Mosoow. pp. 199–208 (in Russian).
Evtushenko, Yu.G. (1985). Numerical Optimization techniques. Optimization software, Inc. Publications Division, New York. 558 pp.
Evtushenko, Yu.G., and V.G. Zhadan (1988). Systematization of nonlinear programming methods. Sequential unconstrained minimization techniques. Computer Center of the USSR Academy of Soienoes, Reports on Appl. Math., 65 pp. (in Russian).
Evtushenko, Yu.G., and V.G. Zhadan (1989). New approaches in optimization techniques. Lecture Notes in Control and Information Soienoes, 143, Proc. of the 14th IPIP Conference. Leipzig: Springer-Verlag, 23–27.
Evtushenko, Yu.G., and V.G. Zhadan (1990 a). Exact auxiliary functions in optimization problems. Journal of oomput. mathematics and Math. PhyB., 30, 1, 43–57 (in Russian).
EvtuBhenko, Yu.G., and V.G. Zhadan (1990 b). Exact auxiliary funotions. Lithuanian academy of sciences, Informatica, 1, 1, 40–58.
Fletcher, R. (1973). An exact penalty function for for nonlinear programming with inequalities. Math Programming, 5, 2, 129–150.
Han, S.-P., and O.L. Mangasarian (1979). Exact penalty functions in nonlinear programming. Math. program., 17, 251–269.
Lootsma, P. (1974). Convergence rate of quadratic exterior penalty-function method for solving constrained-minimization problems. Philips research report, 29, 1, 2–18.
Morrison, D.D. (1968). Optimization by least squares. SIAM J. Numer. Analysis, 5, 1, 83–88.
Soarin, V.D. (1973). On a modification of penalty function method in oonvex programming. Nonlinear optimization and its application in planning, Sverdlovsk, pp. 51–62 (in Russian).
Zangwill, S.-P. (1967). Non-linear programming via penalty function. Manag.Sci. 5, 344–358.
Zhadan, V.G. (1984). On some estimates of the penalty coefficient in methods of exact penalty functions. U.S.S.R. Comput. Maths. Math. Phys., 24, 4, 124–128.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Evtushenko, Y.G., Zhadan, V.G. (1992). Exact Auxiliary Functions in Non-Convex Optimization. In: Oettli, W., Pallaschke, D. (eds) Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51682-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-51682-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55446-2
Online ISBN: 978-3-642-51682-5
eBook Packages: Springer Book Archive