scientific article

zbMath0535.90087MaRDI QIDQ3320147

Jonathan M. Borwein

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex constrained optimizationvector objectives

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Methods of successive quadratic programming type (90C55)

Related Items (13)

V-subdifferentials of convex operators ⋮ Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps ⋮ Conjugate duality in set-valued vector optimization ⋮ The occasional distributivity of ∘ over+e and the change of variable formula for conjugate functions ⋮ On preinvex interval-valued functions and unconstrained interval-valued optimization problems ⋮ Strongly convex set-valued maps ⋮ A variational approach to Lagrange multipliers ⋮ Lagrange duality in set optimization ⋮ Partially finite convex programming. I: Quasi relative interiors and duality theory ⋮ Partially finite convex programming. II: Explicit lattice models ⋮ Lower CS-closed sets and functions ⋮ Norm duality for convex processes and applications ⋮ Conjugate convex operators

This page was built for publication: