Minimization methods for functions on simple sets

DOI10.1007/BF01075073zbMath0642.65047MaRDI QIDQ3783441

V. S. Mikhalevich, N. N. Redkovskij, A. E. Perekatov

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

convex functionsminimization of differentiable functionsnumerical optimization convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (3)

Minimization on a matrix set and identification problems in some mass transfer models ⋮ Minimization methods for smooth nonconvex functions ⋮ Nonlinear structure methods in optimization problems: A survey of the work of N. N. Redkovskij

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for minimizing a differentiable function subject to box constraints and errors
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature
• Elimination of bounds in optimization problems by transforming variables
• On the use of directions of negative curvature in a modified newton method
• Projected Newton Methods for Optimization Problems with Simple Constraints
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems

This page was built for publication: Minimization methods for functions on simple sets