A carregar...

Path Following in the Exact Penalty Method of Convex Programming

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value p...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:Comput Optim Appl
Main Authors: Zhou, Hua, Lange, Kenneth
Formato: Artigo
Idioma:Inglês
Publicado em: 2015
Assuntos:
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC4565725/
https://ncbi.nlm.nih.gov/pubmed/26366044
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s10589-015-9732-x
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!