Convexifactors, generalized convexity and vector optimization

DOI10.1080/02331930410001661505MaRDI QIDQ4656060zbMATH OpenOpenAlexFDO

Authors

Publication date 8 March 2005

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930410001661505

zbMATH Keywords

Convex Analysis, Convex Approximation, Non-smooth Analysis, Convexifactor, Generalized Convex Functions, Vector Optimization

Mathematics Subject Classification ID

Calculus of vector functions (26B12) Convexity of real functions of several variables, generalizations (26B25) Nonsmooth analysis (49J52) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Recommendations

• Convexifactors, generalized convexity, and optimality conditions
• Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
• scientific article; zbMATH DE number 2226570
• Optimality and duality for nonsmooth minimax programming problems using convexifactor
• Approximate convexity in vector optimisation

Cites work

• A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
• A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
• An open mapping theorem using unbounded generalized Jacobians
• Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C¹-data
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• Convexifactors, generalized convexity, and optimality conditions
• Generalized monotonicity of subdifferentials and generalized convexity
• Hunting for a smaller convex subdifferential
• Necessary optimality conditions in nondifferentiable vector optimization
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.

Cited in

(56)

• Convexity and marginal vectors
• On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians
• Vector optimization over cones involving support functions using generalized (,)-convexity
• Sensitivity analysis of the value function for nonsmooth optimization problems
• Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
• Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
• Necessary and sufficient conditions for efficiency via convexificators
• Optimality conditions for nonsmooth semidefinite programming via convexificators
• Optimality conditions in optimization problems with convex feasible set using convexificators
• On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
• Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
• Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
• Optimality conditions and duality for interval-valued optimization problems using convexifactors
• Convexity and optimization in \({\mathbb R^n}\)
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
• Nonsmooth multiobjective programming and constraint qualifications
• On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
• Duality for multiobjective fractional programming problem using convexifactors
• Optimality conditions for optimistic bilevel programming problem using convexifactors
• Convexificators and boundedness of the Kuhn-Tucker multipliers set
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
• Optimality conditions of a set valued optimization problem with the help of directional convexificators
• Duality for a class of nonsmooth multiobjective programming problems using convexificators
• Optimality and duality for nonsmooth minimax programming problems using convexifactor
• On variational inequalities using directional convexificators
• Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
• Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
• On the applications of nonsmooth vector optimization problems to solve generalized vector variational inequalities using convexificators
• Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
• Optimality conditions for maximizing a locally Lipschitz function
• Convexificators and necessary conditions for efficiency
• Applying convexificators in robust multiobjective optimization
• Applying directional upper semi-regular convexificators in bilevel optimization
• Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
• Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds
• On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
• Optimality and duality results for bilevel programming problem using convexifactors
• On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
• Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
• Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems
• On multiobjective optimization problems involving higher order strong convexity using directional convexificators
• First and second order optimality conditions for nonsmooth multiobjective problems with equilibrium constraints
• Convexificators and strong Kuhn-Tucker conditions
• Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality
• On relationships between vector optimization problems and vector variational inequalities using directional convexificators
• Optimality conditions for a class of nonsmooth semidefinite bilevel optimization problems via convexifications applied to bilevel supply chain under uncertainty
• Convexifactors, generalized convexity, and optimality conditions
• Some calculus rules, generalized convexity via convexifactors and their applications
• On multiobjective optimization and approximate vector variational inequalities using directional convexificators
• Duality for fractional interval-valued bilevel optimization problems
• A new Abadie-type constraint qualification for general optimization problems
• Optimality conditions for multiobjective fractional programming, via convexificators
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• Generalized convexity and vector optimization

This page was built for publication: Convexifactors, generalized convexity and vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656060)