ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 59 (1993), S. 325-343 
    ISSN: 1436-4646
    Keywords: Composite functions ; nonsmooth programming ; multi-objective problems ; necessary and sufficient conditions ; scalarizations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper examines nonsmooth constrained multi-objective optimization problems where the objective function and the constraints are compositions of convex functions, and locally Lipschitz and Gâteaux differentiable functions. Lagrangian necessary conditions, and new sufficient optimality conditions for efficient and properly efficient solutions are presented. Multi-objective duality results are given for convex composite problems which are not necessarily convex programming problems. Applications of the results to new and some special classes of nonlinear programming problems are discussed. A scalarization result and a characterization of the set of all properly efficient solutions for convex composite problems are also discussed under appropriate conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 79 (1993), S. 563-580 
    ISSN: 1573-2878
    Keywords: Generalized convex functions ; generalized vector variational inequalities ; multi-objective programming problems ; necessary and sufficient conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, (α, φ,Q)-invexity is introduced, where α:X ×X → intR m + , φ:X ×X →X,X is a Banach space,Q is a convex cone ofR m . This unifies the properties of many classes of functions, such asQ-convexity, pseudo-linearity, representation condition, null space condition, andV-invexity. A generalized vector variational inequality is considered, and its equivalence with a multi-objective programming problem is discussed using (α, φ,Q)-invexity. An existence theorem for the solution of a generalized vector variational inequality is proved. Some applications of (α, φ,Q)-invexity to multi-objective programming problems and to a special kind of generalized vector variational inequality are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 86 (1995), S. 631-648 
    ISSN: 1573-2878
    Keywords: Convex composite minimization problems ; generalized second-order directional derivatives ; generalized Taylor expansions ; basic constraint qualifications ; second-order optimality conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we present second-order optimality conditions for convex composite minimization problems in which the objective function is a composition of a finite-valued or a nonfinite-valued lower semicontinuous convex function and aC 1,1 function. The results provide optimality conditions for composite problems under reduced differentiability requirements.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...