Optimality conditions in optimization problems with convex feasible set using convexificators
From MaRDI portal
Publication:2408896
DOI10.1007/s00186-017-0584-2zbMath1407.90253OpenAlexW2605907306MaRDI QIDQ2408896
Alireza Kabgani, Moslem Zamani, Majid Soleimani-damaneh
Publication date: 10 October 2017
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-017-0584-2
Related Items (13)
On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry ⋮ Optimality conditions for convex problems on intersections of non necessarily convex sets ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ On global subdifferentials with applications in nonsmooth optimization ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization ⋮ Strong subdifferentials: theory and applications in nonconvex optimization ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexifactors, generalized convexity, and optimality conditions
- On representations of the feasible set in convex optimization
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
- A simple characterization of solutions sets of convex programs
- A switching regression method using inequality conditions
- Fractional programming: Applications and algorithms
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Metric regularity and quantitative stability in stochastic programs with probabilistic constraints.
- Optimality conditions in convex optimization revisited
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Necessary and sufficient conditions for efficiency via convexificators
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Nonsmooth vector functions and continuous optimization
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Characterization of solution sets of convex programs
- Optimization of Discontinuous Functions: A Generalized Theory of Differentiation
- RISK MEASURES: RATIONALITY AND DIVERSIFICATION
- Nonsmooth Optimization Using Mordukhovich's Subdifferential
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- On conditions to have bounded multipliers in locally lipschitz programming
- Variational Analysis
- Convexifactors, generalized convexity and vector optimization
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- Continuous generalized convex functions and their characterizations
- Convex Bodies The Brunn-MinkowskiTheory
- Convex Approximations of Chance Constrained Programs
- Nonlinear Programming
This page was built for publication: Optimality conditions in optimization problems with convex feasible set using convexificators
