Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
From MaRDI portal
Publication:2785394
DOI10.1080/02331939608844241zbMath0868.90099OpenAlexW2007772973MaRDI QIDQ2785394
Publication date: 4 August 1997
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939608844241
scalarizationLagrange multiplier theoremnonsmooth constrained multiobjective optimizationvector valued saddle point
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Some nondifferentiable multiobjective programming problems, Optimality and duality in nonsmooth composite vector optimization and applications, Nondifferentiable multiobjective programming under generalized \(d\)-univexity, Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions, Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity, Optimality conditions for a class of composite multiobjective nonsmooth optimization problems, Pseudolinear fuzzy mappings, Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds, Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions, Multiple objective fractional programming involving semilocally type I-preinvex and related functions, A new approach to strong duality for composite vector optimization problems, Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
Cites Work
- Unnamed Item
- Unnamed Item
- Convex composite multi-objective nonsmooth programming
- Second order duality in multiobjective programming
- Geometric consideration of duality in vector optimization
- Theory of multiobjective optimization
- Existence and Lagrangian duality for maximization of set-valued functions
- Some minimax problems of vector-valued functions
- A simple characterization of solutions sets of convex programs
- Proper efficiency with respect to cones
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Optimization and nonsmooth analysis
- On duality for weakly minimized vector valued optimization problems
- Weak minimization and duality
- On generalised convex mathematical programming
- Quasimin and quasisaddlepoint for vector optimization
- Duality for minmax programming involvingV-invex functions
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
