Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
From MaRDI portal
Publication:4639127
DOI10.1080/02331934.2017.1393675zbMath1421.90135OpenAlexW2766278219MaRDI QIDQ4639127
Alireza Kabgani, Majid Soleimani-damaneh
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1393675
linear approximationmultiobjective optimizationsemi-infinite programmingconstraint qualificationgap functionnecessary and sufficient optimality conditionconvexificatorlocally star-shaped domainnonsmooth, noncontinuous, nonconvex optimizationsemi-locally convex
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
On variational inequalities using directional convexificators, Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity, Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming, Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming, Optimality conditions for convex problems on intersections of non necessarily convex sets, Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem, 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 directional upper semi-regular convexificators in bilevel optimization, Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem, Optimality conditions for MPECs in terms of directional upper convexifactors, Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints, On multiobjective bilevel optimization using tangential subdifferentials, On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization, ϵ-Efficient solutions in semi-infinite multiobjective optimization, Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints, Second-order necessary and sufficient optimality conditions for constrained vector equilibrium problem with applications, Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors, Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints, Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization, Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions, On nonsmooth mathematical programs with equilibrium constraints using generalized convexity, Optimality conditions of a set valued optimization problem with the help of directional convexificators, Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization, Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds, Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- Minmax robustness for multi-objective optimization problems
- Robustness in nonsmooth nonlinear multi-objective programming
- Constraint qualifications in convex vector semi-infinite optimization
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Convexificators and strong Kuhn-Tucker conditions
- Second-order optimality conditions for \(C^1\) multiobjective programming problems
- Convexifactors, generalized convexity, and optimality conditions
- On representations of the feasible set in convex optimization
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- First and second order optimality conditions using approximations for nonsmooth vector optimization in Banach spaces
- Semi-infinite programming
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- The gap function for optimization problems in Banach spaces
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Generalizations of convex and related functions
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- The gap function of a convex multicriteria optimization problem
- On the notion of proper efficiency in vector optimization
- Infinite alternative theorems and nonsmooth constraint qualification conditions
- Optimality conditions in convex optimization revisited
- Necessary and sufficient conditions for efficiency via convexificators
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Robust aspects of solutions in deterministic multiple objective linear programming
- Optimality conditions in convex multiobjective SIP
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- On robust multiobjective optimization
- Nonsmooth vector functions and continuous optimization
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Proper efficiency and the theory of vector maximization
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Nonsmooth multiobjective programming and constraint qualifications
- Optimality, duality and gap function for quasi variational inequality problems
- Second Order Optimality Conditions for Problems with Continuously Differentiable Data
- Nonsmooth Optimization Using Mordukhovich's Subdifferential
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C1-data
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- Convexifactors, generalized convexity and vector optimization
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- Multicriteria Optimization
- Constraint qualifications in maximization problems
- Convexificators and necessary conditions for efficiency
- Nonlinear Programming
- Convex Analysis
