Pàgina inicial > Resultats de la cerca: Nonsmooth optimization
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 5 registres trobats en 0.02 segons.
Articles, 5 registres trobats
Articles 5 registres trobats  
1.
15 p, 353.1 KB Optimality conditions for convex problems on intersections of non necessarily convex sets / Allevi, E. (Università degli Studi di Brescia. Dipartimento di Economia e Management) ; Riccardi, R. (Università degli Studi di Brescia. Dipartimento di Economia e Management) ; Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica)
We present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex intersections of non necessarily convex sets. To this aim, we use the notion of local normal cone to a closed set at a point, due to Linh and Penot (SIAM J Optim 17:500-510, 2006). [...]
2020 - 10.1007/s10898-019-00849-z
Journal of global optimization, Vol. 77 (2020) , p. 143-155  
Registre complet -
2.
8 p, 278.6 KB Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints / Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica)
We present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex sets defined by non necessarily convex functions, in terms of tangential subdifferentials. [...]
2015 - 10.1007/s11590-014-0822-y
Optimization Letters, Vol. 9, Núm. 5 (June 2015) , p. 1017-1023  
Registre complet -
3.
17 p, 827.7 KB On piecewise quadratic Newton and trust region problems / Sun, J.
Some recent algorithms for nonsmooth optimization require solutions to certain piecewise quadratic programming subproblems. Two types of subproblems are considered in this paper. The first type seeks the minimization of a continuously differentiable and strictly convex piecewise quadratic function subject to linear equality constraints. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 451-467  
 Accés restringit a la UAB
Registre complet -
4.
19 p, 845.2 KB A trust region method for minimization of nonsmooth functions with linear constraints / Martínez, José Mario ; Moretti, Antonio Carlos
We introduce a trust region algorithm for minimization of nonsmooth functions with linear constraints. At each iteration, the objective function is approximated by a model function that satisfies a set of assumptions stated recently by Qi and Sun in the context of unconstrained nonsmooth optimization. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 431-449  
 Accés restringit a la UAB
Registre complet -
5.
20 p, 827.4 KB Constraint aggregation principle in convex optimization / Ermoliev, Yuri M. ; Kryazhimskii, Arkadii V. ; Ruszczynski, Andrzej
A general constraint aggregation technique is proposed for convex optimization problems. At each iteration a set of convex inequalities and linear equations is replaced by a single surrogate inequality formed as a linear combination of the original constraints. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 353-372  
 Accés restringit a la UAB
Registre complet -

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.
Dipòsit Digital de Documents de la UAB :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem