A global linearization approach to solve nonlinear nonsmooth constrained programming problems

DOI10.1590/S1807-03022011000200010MaRDI QIDQ656550zbMATHOpenAlexFDO

Authors A. V. Kamyad, Sohrab Effati, A. M. Vaziri, A. Jajarmi

Publication date 18 January 2012

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022011000200010&lng=en&nrm=iso&tlng=en

zbMATH Keywords

non-smooth analysisuniform continuitynonlinear programming problemequicontinuity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Discrete approximations in optimal control (49M25)

Recommendations

• A filled function approach for nonsmooth constrained global optimization
• scientific article; zbMATH DE number 4047452
• Globally convergent cutting plane method for nonconvex nonsmooth minimization
• scientific article; zbMATH DE number 3916028
• Programming with a non-differentiable constraint.

Cited in

(5)

• Estimating the robust domain of attraction and directional enlargement of attraction domain via Markov models
• scientific article; zbMATH DE number 169245 (Why is no real title available?)
• scientific article; zbMATH DE number 1786147 (Why is no real title available?)
• Distributed constrained optimization via continuous-time mirror design
• Solving subclass of non-smooth continuous linear and nonlinear programs

This page was built for publication: A global linearization approach to solve nonlinear nonsmooth constrained programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656550)