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