Resultats globals: 12 registres trobats en 0.02 segons.
Articles, 12 registres trobats
Articles 12 registres trobats  1 - 10següent  anar al registre:
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  
2.
17 p, 476.7 KB A quasiconvex asymptotic function with applications in optimization / Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona) ; Hadjisavvas, Nicolas (University of the Aegean) ; Lara, Felipe (Universidad de Tarapacá)
We introduce a new asymptotic function, which is mainly adapted to quasiconvex functions. We establish several properties and calculus rules for this concept and compare it to previous notions of generalized asymptotic functions. [...]
2018 - 10.1007/s10957-018-1317-2
Journal of optimization theory and applications, Vol. 180, Núm. 1 (January 2019) , p. 170-186  
3.
15 p, 334.0 KB A simplified conjugation scheme for lower semi-continuous functions / Elias, Leonardo M. (Universidade Federal do Paraná. Programa de Pós-Graduação em Matemática) ; Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica)
We present two generalized conjugation schemes for lower semi-continuous functions defined on a real Banach space whose norm is Fréchet differentiable off the origin, and sketch their applications to optimization duality theory. [...]
2016 - 10.1080/02331934.2015.1080700
Optimization, Vol. 65, Núm. 4 (2016)  
4.
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  
5.
16 p, 444.8 KB γ-Active constraints in convex semi-infinite programming / Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Todorov, Maxim Ivanov (Universidad de las Américas) ; Zetina, Carlos Armando (Universidad de las Américas)
In this article, we extend the definition of γ-active constraints for linear semi-infinite programming to a definition applicable to convex semi-infinite programming, by two approaches. The first approach entails the use of the subdifferentials of the convex constraints at a point, while the second approach is based on the linearization of the convex inequality system by means of the convex conjugates of the defining functions. [...]
2014 - 10.1080/01630563.2014.895745
Numerical Functional Analysis and Optimization, Vol. 35, Núm. 7-9 (2014) , p. 1078-1094  
6.
59 p, 2.2 MB Discrete convex analysis / Murota, Kazuo
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, separation theorems and the Lagrange duality framework for convex/nonconvex optimization. [...]
1998
Mathematical Programming, vol. 83 n. 3 (1998) p. 313-371  
 Accés restringit a la UAB
7.
27 p, 1.1 MB A dual-active-set algorithm for positive semi-definite quadratic programming / Boland, N.L.
Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming problems are valued. Goldfarb and Idnani (1983) describe one such method. [...]
1997
Mathematical Programming, vol. 78 n. 1 (1997) p. 1-27  
 Accés restringit a la UAB
8.
19 p, 655.9 KB A preconditioning proximal Newton method for nondifferentiable convex optimization / Qi, Liqun ; Chen, Xiaojun
We propose a proximal Newton method for solving nondifferentiable convex optimization. This method combines the generalized Newton method with Rockafellar's proximal point algorithm. At each step, the proximal point is found approximately and the regularization matrix is preconditioned to overcome inexactness of this approximation. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 411-429  
 Accés restringit a la UAB
9.
18 p, 881.4 KB Variable metric bundle methods : From conceptual to implementable forms / Lemaréchal, Claude ; Sagastizábal, Claudia
To minimize a convex function, we combine Moreau-Yosida regularizations, quasi-Newton matrices and bundling mechanisms. First we develop conceptual forms using "reversal" quasi-Newton formulae and we state their global and local convergence. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 393-410  
 Accés restringit a la UAB
10.
19 p, 774.0 KB Separating plane algorithms for convex optimization / Nurminski, Evgeni A.
The equivalent formulation of a convex optimization problem is the computation of a value of a conjugate function at the origin. The latter can be achieved by approximation of the epigraph of the conjugate function around the origin and gradual refinement of the approximation. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 373-391  
 Accés restringit a la UAB

Articles : 12 registres trobats   1 - 10següent  anar al registre:
Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.