Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†

DOI10.1080/02331939208843781zbMath0817.90117OpenAlexW2049774238MaRDI QIDQ4327906

No author found.

Publication date: 7 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843781

zbMATH Keywords

Kuhn- Tucker conditionsconstrained nonsmooth optimizationsubgradient projection algorithms\(\varepsilon\)- adjusted rules\(\varepsilon\)-active constraints\(\varepsilon\)-projection directionnonlinearly smooth constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites Work

• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
• Subgradient projection algorithm. II
• Extensions of subgradient projection algorithms
• Algorithm Models for Nondifferentiable Optimization
• Implementation of a subgradient projection algorithm II
• Optimization and nonsmooth analysis
• An active set method for solving linearly constrained nonsmooth optimization problems
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• A Kuhn–Tucker Algorithm

This page was built for publication: Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†