Abstract
The paper deals with mathematical programming and algebraic problems, by formulating both ones as nonsmooth unconstrained optimization problems. Therefore minimization algorithms, using monotone generalized subdifferentials, are define and numerical results reported, to show their performance.
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
