About
Contact
Help
Sending publications
How to publish
Advanced Search
View Item 
  •   Home
  • Facultad de Ciencias Físicas y Matemáticas
  • Artículos de revistas
  • View Item
  •   Home
  • Facultad de Ciencias Físicas y Matemáticas
  • Artículos de revistas
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse byCommunities and CollectionsDateAuthorsTitlesSubjectsThis CollectionDateAuthorsTitlesSubjects
Biblioteca Digital - Universidad de Chile
Revistas Chilenas
Repositorios Latinoamericanos
Tesis LatinoAmericanas
Tesis chilenas
Related linksRegistry of Open Access RepositoriesOpenDOARGoogle scholarCOREBASE
My Account
Login to my accountRegister

Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming

Artículo
Thumbnail
Open/Download
IconInterior-proximal-bundle-algorithm.pdf (121.5Kb)
Access note
Acceso a solo metadatos
Publication date
2016
Metadata
Show full item record
Cómo citar
Álvarez Daziano, Felipe
Cómo citar
Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
.
Copiar
Cerrar
Author
  • Álvarez Daziano, Felipe;
  • López Luis, Julio;
Abstract
This paper is devoted to the study of a bundle proximal-type algorithm for solving the problem of minimizing a nonsmooth closed proper convex function subject to symmetric cone constraints, which include the positive orthant in, the second-order cone, and the cone of positive semidefinite symmetric matrices. On the one hand, the algorithm extends the proximal algorithm with variable metric described by Alvarez et al. to our setting. We show that the sequence generated by the proposed algorithm belongs to the interior of the feasible set by an appropriate choice of a regularization parameter. Also, it is proven that each limit point of the sequence generated by the algorithm solves the problem. On the other hand, we provide a natural extension of bundle methods for nonsmooth symmetric cone programs. We implement and test numerically our bundle algorithm with some instances of Euclidean Jordan algebras
Patrocinador
FONDECYT 1160894 1130176 Millennium Scientific Institute on Complex Engineering Systems ICM: P-05-004-F CONICYT: FBO16
Indexation
Artículo de publicación ISI
Identifier
URI: https://repositorio.uchile.cl/handle/2250/141719
DOI: 10.1080/02331934.2016.1193863
Quote Item
Optimization Volumen: 65 Número: 9 Páginas: 1757-1779 (2016)
Collections
  • Artículos de revistas
xmlui.footer.title
31 participating institutions
More than 73,000 publications
More than 110,000 topics
More than 75,000 authors
Published in the repository
  • How to publish
  • Definitions
  • Copyright
  • Frequent questions
Documents
  • Dating Guide
  • Thesis authorization
  • Document authorization
  • How to prepare a thesis (PDF)
Services
  • Digital library
  • Chilean academic journals portal
  • Latin American Repository Network
  • Latin American theses
  • Chilean theses
Dirección de Servicios de Información y Bibliotecas (SISIB)
Universidad de Chile

© 2020 DSpace
  • Access my account