Convexifactors, generalized convexity, and optimality conditions

DOI10.1023/A:1014853129484zbMath1172.90500OpenAlexW1561724005MaRDI QIDQ700700

Publication date: 8 October 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014853129484

zbMATH Keywords

generalized convexity convexificator constrained programming problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), Optimality conditions and duality for interval-valued optimization problems using convexifactors, Optimality conditions for pessimistic bilevel problems using convexificator, Necessary optimality conditions in terms of convexificators in Lipschitz optimization, Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case, Optimality conditions for maximizing a locally Lipschitz function, Continuous generalized convex functions and their characterizations, A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem, 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, A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators, Sufficient Optimality Conditions for a Robust Multiobjective Problem, 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, Semistrictly and neatly quasiconvex programming using lower global subdifferentials, Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, Correction to: ``Optimality conditions for pessimistic bilevel problems using convexificator, Optimality conditions for MPECs in terms of directional upper convexifactors, Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem, Optimality and duality results for bilevel programming problem using convexifactors, Correction to: ``Convexifactors, generalized convexity, and optimality conditions, Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem, Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators, Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators, Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization, Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation, Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints, Convexificators and necessary conditions for efficiency, Necessary and sufficient conditions for efficiency via convexificators, Convexifactors, generalized convexity and vector optimization, Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization, Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion, Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints, Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation, Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming, Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators, Optimality and duality for nonsmooth minimax programming problems using convexifactor

Cites Work