scientific article; zbMATH DE number 3662118
From MaRDI portal
Publication:3860434
zbMATH Open0425.49027MaRDI QIDQ3860434FDOQ3860434
Authors: S. S. Kutateladze 
Publication date: 1979
Title of this publication is not available (Why is that?)
Convex programming (90C25) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Mathematical programming (90C99)
Cited In (96)
- Approximate optimality conditions for composite convex optimization problems
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- A unified stability result with perturbations in vector optimization
- A general representation of \(\delta\)-normal sets to sublevels of convex functions
- A kind of unified super efficiency via assumption (A) and applications in vector optimization
- Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions
- Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
- Duality related to approximate proper solutions of vector optimization problems
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Approximation of weak efficient solutions in vector optimization
- \(E\)-super efficiency of set-valued optimization problems involving improvement sets
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- A survey of vector optimization in infinite-dimensional spaces. II
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
- A combined scalarizing method for multiobjective programming problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- The extremal structure of convex sets of multilinear operators
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Pointwise well-posedness in set optimization with cone proper sets
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- Limiting behavior of the approximate second-order subdifferential of a convex function
- Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
- Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- On approximate solutions in vector optimization problems via scalarization
- Approximate quasi solutions of multiobjective optimization problems
- A combined scalarization method for multi-objective optimization problems
- On approximate efficiency in multiobjective programming
- Decision uncertainty in multiobjective optimization
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Local convex analysis
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Concepts for approximate solutions of vector optimization problems with variable order structures
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
- Cone characterizations of approximate solutions in real vector optimization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- A generalization of the Fenchel-Moreau theorem
- Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
- Tradeoff-based decomposition and decision-making in multiobjective programming
- Approximation in multiobjective optimization
- Advancing local search approximations for multiobjective combinatorial optimization problems
- On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
- A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Hadamard well-posed vector optimization problems
- Lipschitz continuity of V-subdifferentials of convex operators
- Borwein-Preiss vector variational principle
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Covers and approximations in multiobjective optimization
- Axiomatic approach to approximate solutions in multiobjective optimization
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- V-subdifferentials of convex operators
- Set-valued pseudo-metric families and Ekeland's variational principles in fuzzy metric spaces
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
- A kind of unified proper efficiency in vector optimization
- Approximate weak minimal solutions of set-valued optimization problems
- Coradiant-valued maps and approximate solutions in variable ordering structures
- Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems
- Approximate elements for set optimization problems with respect to variable domination structures
- Well-posedness and existence for the weak multicriteria Nash equilibrium of multicriteria games
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization
- Limit behavior of approximate proper solutions in vector optimization
- Ekeland variational principles involving set perturbations in vector equilibrium problems
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Exact and approximate vector Ekeland variational principles
- ANOVA-MOP: ANOVA decomposition for multiobjective optimization
- Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- \(\varepsilon k^ 0\)-subdifferentials of convex functions
- Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems
- Approximate Lagrangian duality and saddle point optimality in set optimization
- Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- A note on approximate proper efficiency in linear fractional vector optimization
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Approximate properly solutions of constrained vector optimization with variable coradiant sets
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3860434)
