Convexifactors, generalized convexity and vector optimization

DOI10.1080/02331930410001661505zbMath1079.90104OpenAlexW2007152910MaRDI QIDQ4656060

No author found.

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

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

Related Items (40)

Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ On variational inequalities using directional convexificators ⋮ On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ Optimality conditions for maximizing a locally Lipschitz function ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Duality for multiobjective fractional programming problem using convexifactors ⋮ 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 ⋮ Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds ⋮ Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem ⋮ On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential ⋮ Optimality and duality results for bilevel programming problem using convexifactors ⋮ 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 ⋮ 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 and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization ⋮ Convexificators and necessary conditions for efficiency ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ 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 ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity ⋮ Optimality conditions of a set valued optimization problem with the help of directional convexificators ⋮ Nonsmooth multiobjective programming and constraint qualifications ⋮ A new Abadie-type constraint qualification for general optimization problems ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Duality for a class of nonsmooth multiobjective programming problems using convexificators ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators

Cites Work

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

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