scientific article; zbMATH DE number 29728
From MaRDI portal
Publication:3984868
zbMATH Open0760.65066MaRDI QIDQ3984868
Publication date: 27 June 1992
Title of this publication is not available (Why is that?)
convergencesubgradient projection algorithmnonlinear constraintszigzaggingKuhn-Tucker pointsconstrained nonsmooth optimization
Related Items (1)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Subgradient projection algorithms and approximate solutions of convex feasibility problems ๐ ๐
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope ๐ ๐
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization ๐ ๐
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraintsโ ๐ ๐
- Subgradient method with feasible inexact projections for constrained convex optimization problems ๐ ๐
- The Projected Subgradient Algorithm in Convex Optimization ๐ ๐
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984868)