Nonsmooth multiobjective programming
From MaRDI portal
Publication:3789355
DOI10.1080/01630568908816290zbMath0645.90076OpenAlexW2151920991MaRDI QIDQ3789355
Publication date: 1989
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568908816290
Lipschitz functionsweak minimumvector dual problemgeneral cone constraintsnecessary Lagrangian conditionsnonsmooth constrained multiobjective programming
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)
Related Items (39)
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization ⋮ Nonsmooth vector-valued invex functions and applications ⋮ An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems ⋮ Necessary optimality conditions with a modified subdifferential ⋮ On fractional vector optimization over cones with support functions ⋮ OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION ⋮ Duality in Vector Optimization Under Type 1 α-Invexity in Banach Spaces ⋮ Invex optimisation problems ⋮ Optimality conditions in quasidifferentiable vector optimization ⋮ Optimality conditions for a class of composite multiobjective nonsmooth optimization problems ⋮ Vector optimization over cones involving support functions using generalized \((\Phi,\rho)\)-convexity ⋮ Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results ⋮ Higher-order duality relations for multiobjective fractional problems involving support functions ⋮ Locally Lipschitz vector optimization with inequality and equality constraints. ⋮ First order optimality conditions in vector optimization involving stable functions ⋮ The Exactness Property of the Vector Exact l1 Penalty Function Method in Nondifferentiable Invex Multiobjective Programming ⋮ Bounded sets of KKT multipliers in vector optimization ⋮ Optimality conditions for \(C^{1,1}\) constrained multiobjective problems ⋮ The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems ⋮ Saddle point criteria in multiobjective fractional programming involving exponential invexity ⋮ Perturbing convex multiobjecttve programs ⋮ Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces ⋮ Vector critical points and cone efficiency in nonsmooth vector optimization ⋮ Optimization with set-functions described by functions ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ Non-differentiable vector programming problem and duality for higher-order cone convex functions ⋮ Higher-order duality for multiobjective optimization problems containing support functions over cones ⋮ Necessary optimality conditions in nondifferentiable vector optimization ⋮ Mean value theorem for continuous vector functions by smooth approximations. ⋮ Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces ⋮ Optimality conditions for \(C^{1,1}\) vector optimization problems ⋮ Invex multifunctions and duality ⋮ On nonsmooth multiobjective programming with generalized univexity ⋮ Invexity in multifunction optimization ⋮ Higher order duality for cone vector optimization problems ⋮ Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity ⋮ Quasimin and quasisaddlepoint for vector optimization ⋮ Dini set-valued directional derivative in locally Lipschitz vector optimization ⋮ Regularity conditions in vector optimization
Cites Work
- Unnamed Item
- A modified wolfe dual for weak vector minimization
- Optimization and nonsmooth analysis
- Nondifferentiable optimization by smooth approximations
- On optimality conditions in nonsmooth inequality constrained minimization
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Lagrangean conditions and quasiduality
- Nonconvex theorems of the alternative and minimization
This page was built for publication: Nonsmooth multiobjective programming