Nonsmooth multiobjective programming
From MaRDI portal
Publication:3789355
Recommendations
- scientific article; zbMATH DE number 751236
- Nonsmooth multiobjective programming and constraint qualifications
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- scientific article; zbMATH DE number 515354
- Optimality conditions for a class of nonsmooth multi-objective programming problems
Cites work
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- A modified wolfe dual for weak vector minimization
- Lagrangean conditions and quasiduality
- Nonconvex theorems of the alternative and minimization
- Nondifferentiable optimization by smooth approximations
- On optimality conditions in nonsmooth inequality constrained minimization
- Optimization and nonsmooth analysis
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
Cited in
(44)- Dini set-valued directional derivative in locally Lipschitz vector optimization
- Invex optimisation problems
- On nonsmooth multiobjective programming with generalized univexity
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- Vector optimization over cones involving support functions using generalized \((\Phi,\rho)\)-convexity
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Higher-order duality relations for multiobjective fractional problems involving support functions
- Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
- Duality in Vector Optimization Under Type 1 α-Invexity in Banach Spaces
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results
- Locally Lipschitz vector optimization with inequality and equality constraints.
- Bounded sets of KKT multipliers in vector optimization
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Necessary optimality conditions in nondifferentiable vector optimization
- Lagrange multipliers and generalized differentiable functions in vector extremum problems
- First order optimality conditions in vector optimization involving stable functions
- Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- Optimality conditions in quasidifferentiable vector optimization
- Perturbing convex multiobjecttve programs
- The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
- scientific article; zbMATH DE number 1749781 (Why is no real title available?)
- Optimality conditions for \(C^{1,1}\) vector optimization problems
- Nonsmooth vector-valued invex functions and applications
- Saddle point criteria in multiobjective fractional programming involving exponential invexity
- Invex multifunctions and duality
- Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Higher order duality for cone vector optimization problems
- Higher-order duality for multiobjective optimization problems containing support functions over cones
- scientific article; zbMATH DE number 3941279 (Why is no real title available?)
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- Regularity conditions in vector optimization
- Invexity in multifunction optimization
- Necessary optimality conditions with a modified subdifferential
- Quasimin and quasisaddlepoint for vector optimization
- Optimality conditions for \(C^{1,1}\) constrained multiobjective problems
- Mean value theorem for continuous vector functions by smooth approximations.
- Optimization with set-functions described by functions
- Non-differentiable vector programming problem and duality for higher-order cone convex functions
- On fractional vector optimization over cones with support functions
This page was built for publication: Nonsmooth multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789355)
