Treffer: An algorithm for nonconvex lower semicontinuous optimization problems

Title:
An algorithm for nonconvex lower semicontinuous optimization problems
Authors:
Source:
AAIM 2005 : algorithmic applications in management (Xian, 22-25 June 2005)Lecture notes in computer science. :26-36
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Facultad de Ingeniería, Universidad Católica de la Ssma. Concepción, Casilla 297, Concepción, Chile
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.16894851
Database:
PASCAL Archive

Weitere Informationen

In this paper we study an algorithm to find critical points of a lower semicontinuous nonconvex function. We use the Moreau regularization for a special type of functions belonging to the class of prox-regular functions which have very interesting algorithmic properties. We show that it is possible to generate an algorithm in order to obtain a critical point using the theory developed for the composite functions and also the results for the solutions of nonsmooth vectorial equations. We prove the convergence of the algorithm and some estimations of the convergence speed.