Abstract
The mathematical programming problem with constraints in the form of convex inequalities, and a method of linearization for solving the problem, are studied. It is shown that the method has all the properties of the classical gradient descent method, widely used in unconstrained optimization problems. The method does not employ evaluations of the second derivatives or their approximation, and converges with an arbitrarily chosen initial approximation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computational Mathematics and Mathematical Physics
Paper Title
Journal
Date
