Optimization problems in statistical learning: Duality and optimality conditions

2011 ◽  
Vol 213 (2) ◽  
pp. 395-404 ◽  
Author(s):  
Radu Ioan Boţ ◽  
Nicole Lorenz
2021 ◽  
Vol 78 (1) ◽  
pp. 139-156
Author(s):  
Antonio Boccuto

Abstract We give some versions of Hahn-Banach, sandwich, duality, Moreau--Rockafellar-type theorems, optimality conditions and a formula for the subdifferential of composite functions for order continuous vector lattice-valued operators, invariant or equivariant with respect to a fixed group G of homomorphisms. As applications to optimization problems with both convex and linear constraints, we present some Farkas and Kuhn-Tucker-type results.


2017 ◽  
Vol 9 (4) ◽  
pp. 168
Author(s):  
Giorgio Giorgi

We take into condideration necessary optimality conditions of minimum principle-type, that is for optimization problems having, besides the usual inequality and/or equality constraints, a set constraint. The first part pf the paper is concerned with scalar optimization problems; the second part of the paper deals with vector optimization problems.


Author(s):  
Thanh-Hung Pham

Based on the notation of Mordukhovich subdifferential in [27], we propose some of new concepts of convexity to establish optimality conditions for quasi ?-solutions for nonlinear semi-infinite optimization problems with data uncertainty in constraints. Moreover, some examples are given to illustrate the obtained results.


Sign in / Sign up

Export Citation Format

Share Document