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

DOI10.1080/02331939208843781MaRDI QIDQ4327906zbMATH OpenOpenAlexFDO

Authors

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

\(\varepsilon\)- adjusted rules\(\varepsilon\)-active constraints\(\varepsilon\)-projection directionconstrained nonsmooth optimizationKuhn- Tucker conditionsnonlinearly smooth constraintssubgradient projection algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 29728
• scientific article; zbMATH DE number 727769
• scientific article; zbMATH DE number 11412
• A conjugate projection gradient algorithm for nonlinear constrained optimization
• Subgradient projection algorithm. II

Cites work

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

Cited in

(8)

• Extensions of subgradient projection algorithms
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• scientific article; zbMATH DE number 11412 (Why is no real title available?)
• scientific article; zbMATH DE number 29728 (Why is no real title available?)
• scientific article; zbMATH DE number 1131727 (Why is no real title available?)
• A subgrid projection method for relaxation of non-attainable differential inclusions
• Subgradient method with feasible inexact projections for constrained convex optimization problems
• Nonsmooth projection-free optimization with functional constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327906)