An algorithm for composite nonsmooth optimization problems

DOI10.1007/BF00940574zbMath0562.90077OpenAlexW1986947514MaRDI QIDQ1057188

J. Blot

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940574

zbMATH Keywords

descent methodgeneralized gradientactive set strategynumerical experienceNonsmooth optimizationmax functionsquasi-Newton approximationreduced curvature approximations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Multiple models, multiplicative noise and linear quadratic control—algorithmic aspects, Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components, On the numerical treatment of nonconvex energy problems of mechanics, Continuity of the null space basis and constrained optimization, Delamination of composites as a substationarity problem: Numerical approximation and algorithms, Algorithms with adaptive smoothing for finite minimax problems, Discontinuous piecewise linear optimization, Qualitative aspects of the local approximation of a piecewise differentiable function, Mathematical programming formulations for piecewise polynomial functions, Convergence analysis of a proximal Gauss-Newton method, Harnessing Structure in Composite Nonsmooth Minimization, An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems, Variants to the cutting plane approach for convex nondifferentiable optimization, Convergence of an interior point algorithm for continuous minimax, Difference convex optimization techniques in nonsmooth computational mechanics, 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, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, A spline smoothing Newton method for finite minimax problems, A dual algorithm for minimax problems, A truncated aggregate smoothing Newton method for minimax problems, Superlinearly convergent algorithm for min-max problems, Composite nonsmooth optimization using approximate generalized gradient vectors, Generalized desirability functions: a structural and topological analysis of desirability functions, An active set smoothing method for solving unconstrained minimax problems, Approximation in normed linear spaces, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, An \(\epsilon\)-active barrier-function method for solving minimax problems, Local properties of algorithms for minimizing nonsmooth composite functions, Nonmonotone line search for minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steplength algorithms for minimizing a class of nondifferentiable functions
• A note on the computation of an orthonormal basis for the null space of a matrix
• The computation of Lagrange-multiplier estimates for constrained minimization
• Variable metric methods for minimizing a class of nondifferentiable functions
• Combined lp and quasi-Newton methods for minimax optimization
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Optimality conditions for piecewise smooth functions
• A model algorithm for composite nondifferentiable optimization problems
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• Generalized Gradients and Applications
• An Ideal Penalty Function for Constrained Optimization
• Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
• Numerically stable methods for quadratic programming
• Algorithms for nonlinear constraints that use lagrangian functions
• An Efficient Method to Solve the Minimax Problem Directly
• Numerical Solution of Systems of Nonlinear Equations
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation