Pages that link to "Item:Q1057188"
From MaRDI portal
The following pages link to An algorithm for composite nonsmooth optimization problems (Q1057188):
Displaying 34 items.
- Gradient methods for minimizing composite functions (Q359630) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- An \(\epsilon\)-active barrier-function method for solving minimax problems (Q806678) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
- A constrained min-max algorithm for rival models of the same economic system (Q1184350) (← links)
- A barrier function method for minimax problems (Q1186276) (← links)
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems (Q1312090) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- Approximation in normed linear spaces (Q1587393) (← links)
- A dual algorithm for minimax problems (Q1767399) (← links)
- On the numerical treatment of nonconvex energy problems of mechanics (Q1905960) (← links)
- Delamination of composites as a substationarity problem: Numerical approximation and algorithms (Q1912174) (← links)
- Convergence analysis of a proximal Gauss-Newton method (Q1928745) (← links)
- Convergence of an interior point algorithm for continuous minimax (Q1956470) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization (Q3485803) (← links)
- Local properties of algorithms for minimizing nonsmooth composite functions (Q3688120) (← links)
- Continuity of the null space basis and constrained optimization (Q3734171) (← links)
- Multiple models, multiplicative noise and linear quadratic control—algorithmic aspects (Q3980079) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)
- Difference convex optimization techniques in nonsmooth computational mechanics (Q4354081) (← links)
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
- Qualitative aspects of the local approximation of a piecewise differentiable function (Q4842616) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Generalized desirability functions: a structural and topological analysis of desirability functions (Q5207737) (← links)
- Composite nonsmooth optimization using approximate generalized gradient vectors (Q5959905) (← links)
- Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
