Carregant...
Carregant...

Vés al contingut (premeu Retorn)

AAR-based decomposition algorithm for non-linear convex optimisation

Autor
Rabiei, S.; Muñoz, J.J.
Tipus d'activitat
Article en revista
Revista
Computational optimization and applications
Data de publicació
2015-12-01
Volum
62
Pàgina inicial
761
Pàgina final
761
DOI
https://doi.org/10.1007/s10589-015-9750-8 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/76414 Obrir en finestra nova
URL
http://dx.doi.org/10.1007/s10589-015-9750-8 Obrir en finestra nova
Resum
n this paper we present a method for decomposing a class of convex nonlinear programmes which are frequently encountered in engineering plastic analysis. These problems have second-order conic memberships constraints and a single complicating variable in the objective function. The method is based on finding the distance between the feasible sets of the decomposed problems, and updating the global optimal value according to the value of this distance. The latter is found by exploiting the method...
Citació
Rabiei, S., Muñoz, J.J. AAR-based decomposition algorithm for non-linear convex optimisation. "Computational optimization and applications", 2015.
Paraules clau
Averaged alternating reflections (AAR), Convex optimisation, Decomposition, Non-linear optimisation, Second-order cone program (SOCP)
Grup de recerca
LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria

Participants

Arxius