Keywords
- Search Direction
- Step Length
- Penalty Parameter
- Accumulation Point
- Descent Direction
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Conn, A.R. "Constrained Optimization Using a Nondifferentiable Penalty Function", SIAM J. Numer. Anal. 10, 760–784, (1973).
Conn, A.R. and Pietrzykowski, T. "A Penalty Function Method Converging Directly to a Constrained Optimum", SIAM J. Numer. Anal. 14, 348–378, (1977).
Han, S.P. "A Globally Convergent Method for Nonlinear Programming Problems", JOTA, 22, 297–309, (1977).
Levitin, E.S. and Polyak, B.T. "Constrained Minimization Methods", USSR Computational Mathematics and Mathematical Physics, 6, 1–15, (1966).
Maratos, N. "Exact Penalty Function Algorithms for Finite Dimensional and Control Optimization Problems", Ph.D. thesis, Imperial College, London, (1978).
Mayne, D.Q. and Maratos, N. "A First Order Exact Penalty Function Algorithm for Equality Constrained Optimization Problems", Mathematical Programming, 16, 303–324, (1979).
Mayne, D.Q. and Polak, E. "A Superlinearly Convergent Algorithm for Constrained Optimization Problems", Research Report, C.C.D., Imperial College, 78/52, (1978).
Polak, E. "Computational Methods in Optimization, A Unified Approach", Academic Press, (1971).
Powell, M.J.D. "A Fast Algorithm for Nonlinearly Constrained Optimization Calculations", in Numerical Analysis, ed. G.A. Watson, Springer Verlag, (1978).
Powell, M.J.D. "The Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization Problems", Technical Memorandum 315, Applied Mathematics Division, Argonne National Laboratory, Illinois, (1977).
Charalambous, C. "A lower bound for the controlling parameters of the exact penalty functions", Mathematical Programming, 15, 278–290, (1978).
Robinson, S.M. "Perturbed Kuhn-Tucker Points and Rates of Convergence for a Class of Nonlinear Programming Algorithms", Mathematical Programming, 7, 1–16, (1972).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Mayne, D.Q. (1980). On the use of exact penalty functions to determine step length in optimization algorithms. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0094166
Download citation
DOI: https://doi.org/10.1007/BFb0094166
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09740-2
Online ISBN: 978-3-540-38562-2
eBook Packages: Springer Book Archive
