Pseudonormality and a Lagrange multiplier theory for constrained optimization
type: Item
instance of: scholarly article
title: Pseudonormality and a Lagrange multiplier theory for constrained optimization
zbMATH Open document ID: 1026.90092
DOI: 10.1023/A:1016083601322
author: Dimitri P. Bertsekas
author: Asuman Ozdaglar
published in: Journal of Optimization Theory and Applications
publication date: 2003-03-10T00:00:00Z
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1879248
zbMATH Keywords: pseudonormality
zbMATH Keywords: informative Lagrange multipliers
zbMATH Keywords: constraint qualifications
zbMATH Keywords: exact penalty functions
MaRDI profile type: Publication
cites work: Q3134873
cites work: Variational Analysis
cites work: Maximum principle in the problem of time optimal response with nonsmooth constraints
cites work: Convex analysis and nonlinear optimization. Theory and examples
cites work: Q4093215
cites work: Lagrange Multipliers and Optimality
cites work: Q5574526
cites work: Constraint qualifications in maximization problems
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: Q4503250
cites work: An Exact Potential Method for Constrained Maxima
cites work: Non-Linear Programming Via Penalty Functions
cites work: Exact penalty functions in nonlinear programming
cites work: Sufficient conditions for a globally exact penalty function without convexity
cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
cites work: A Necessary and Sufficient Qualification for Constrained Optimization
cites work: Geometry of optimality conditions and constraint qualifications
cites work: A New Approach to Lagrange Multipliers
cites work: Optimization and nonsmooth analysis
cites work: The Lagrange Multiplier Rule
cites work: Convex Analysis
cites work: A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
description: scientific article; zbMATH DE number 1879248