An algorithm for composite nonsmooth optimization problems
From MaRDI portal
Publication:1057188
DOI10.1007/BF00940574zbMath0562.90077MaRDI QIDQ1057188
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
descent method; generalized gradient; active set strategy; numerical experience; Nonsmooth optimization; max functions; quasi-Newton approximation; reduced curvature approximations
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Related Items
Variants to the cutting plane approach for convex nondifferentiable optimization, Difference convex optimization techniques in nonsmooth computational mechanics, Qualitative aspects of the local approximation of a piecewise differentiable function, A successive quadratic programming method for a class of constrained nonsmooth optimization problems, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, A constrained min-max algorithm for rival models of the same economic system, A barrier function method for minimax problems, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, Nonmonotone line search for minimax problems, Discontinuous piecewise linear optimization, On the numerical treatment of nonconvex energy problems of mechanics, Delamination of composites as a substationarity problem: Numerical approximation and algorithms, Multiple models, multiplicative noise and linear quadratic control—algorithmic aspects
