Pages that link to "Item:Q3730358"
From MaRDI portal
The following pages link to A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358):
Displaying 17 items.
- Linear-programming approach to nonconvex variational problems (Q706592) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- The linearized version of an algorithm for the mixed norms problem (Q912569) (← links)
- A bundle-type auxiliary problem method for solving generalized variational-like inequalities (Q945201) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization (Q2060804) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- A linearized finite-difference method for the solution of some mixed concave and convex non-linear problems (Q2479164) (← links)
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (Q2786335) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization (Q2934466) (← links)
- Extension of unconstrained minimization methods to linearly constrained problems (Q3220108) (← links)
- A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
- (Q3972979) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization (Q5378462) (← links)
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization (Q5956437) (← links)
