Convexifactors, generalized convexity, and optimality conditions
From MaRDI portal
Publication:700700
DOI10.1023/A:1014853129484zbMATH Open1172.90500OpenAlexW1561724005MaRDI QIDQ700700FDOQ700700
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
Recommendations
- Convexifactors, generalized convexity and vector optimization
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
Optimality conditions and duality in mathematical programming (90C46) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Small convex-valued subdifferentials in mathematical programming
- Title not available (Why is that?)
- Characterisations of quasiconvex functions
- Generalized monotonicity of subdifferentials and generalized convexity
- Generalized monotone set valued maps and support bifunctions
- On generalised convex nonsmooth functions
Cited In (46)
- Optimality and duality for nonsmooth minimax programming problems using convexifactor
- Convexifactors, generalized convexity and vector optimization
- Convexification of a positive homogeneous function
- Sufficient Optimality Conditions for a Robust Multiobjective Problem
- Optimality conditions for pessimistic bilevel problems using convexificator
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
- Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Optimality conditions for maximizing a locally Lipschitz function
- Duality for multiobjective fractional programming problem using convexifactors
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Convexificators and necessary conditions for efficiency
- Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators
- Correction to: ``Optimality conditions for pessimistic bilevel problems using convexificator
- Applying directional upper semi-regular convexificators in bilevel optimization
- Optimality conditions for MPECs in terms of directional upper convexifactors
- A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- Necessary and sufficient conditions for efficiency via convexificators
- On the partial calmness condition for an interval-valued bilevel optimization problem
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Applying convexificators in robust multiobjective optimization
- Semistrictly and neatly quasiconvex programming using lower global subdifferentials
- Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems
- Continuous generalized convex functions and their characterizations
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Correction to: ``Convexifactors, generalized convexity, and optimality conditions
- Erratum to: optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Optimality and duality results for bilevel programming problem using convexifactors
- IFSs consisting of generalized convex contractions
- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion
- 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 in terms of convexificators for a bilevel multiobjective optimization problem
- Title not available (Why is that?)
This page was built for publication: Convexifactors, generalized convexity, and optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700700)
