Indicating cones and the intersection principle for tangential approximants in abstract multiplier rules

DOI10.1007/BF00935756zbMath0427.49025OpenAlexW2019035909MaRDI QIDQ1136345

S. H. Smith

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00935756

zbMATH Keywords

tangent conesintersection principlemethod of tents

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Methods of successive quadratic programming type (90C55)

Related Items

A multiplier rule on a metric space, Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization, Adjacent and tangent regularity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalization of the Dubovitzky-Milutyn optimality conditions
• A short proof of a general multiplier rule
• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• THE METHOD OF TENTS IN THE THEORY OF EXTREMAL PROBLEMS
• Constrained Minimization Problems in Finite-Dimensional Spaces
• On Variational Theory and Optimal Control Theory
• Extremum problems in the presence of restrictions
• An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. I. General Theory
• An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. II. Applications
• Maximum Principle for Semiconvex Performance Functionals
• On Multipliers for Lagrange Problems