Abstract
AbstractIt is shown that separable nonlinear programming problems may be solved approximately by using existing quadratic programming algorithms. The approach is to approximate the gradient functions by segmented linear functions which implies the approximation of the objective function by a smooth series of quadratic functions. A numerical example illustrates the technique.
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 call
