Pages that link to "Item:Q1091267"
From MaRDI portal
The following pages link to Penalty-proximal methods in convex programming (Q1091267):
Displaying 32 items.
- Coupling the gradient method with a general exterior penalization scheme for convex minimization (Q415412) (← links)
- Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
- Lagrangian-penalization algorithm for constrained optimization and variational inequalities (Q452269) (← links)
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's (Q642609) (← links)
- Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
- Parametric proximal-point methods (Q956617) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Penalization in non-classical convex programming via variational convergence (Q1181900) (← links)
- Proximal methods in view of interior-point strategies (Q1265063) (← links)
- Prox-regularization and solution of ill-posed elliptic variational inequalities (Q1265616) (← links)
- The perturbed proximal point algorithm and some of its applications (Q1317307) (← links)
- Convergence of diagonally stationary sequences in convex optimization (Q1332534) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- Coupling the proximal point algorithm with approximation methods (Q1379933) (← links)
- Iterative regularization via dual diagonal descent (Q1703168) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- Family of perturbation methods for variational inequalities (Q1918010) (← links)
- Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
- The proximity operator of the log-sum penalty (Q2103448) (← links)
- Theoretical aspect of diagonal Bregman proximal methods (Q2176024) (← links)
- Alternating forward-backward splitting for linearly constrained optimization problems (Q2191282) (← links)
- Penalty decomposition methods for rank minimization (Q2943834) (← links)
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
- Proximal interior point approach in convex programming (ill-posed problems)<sup>*</sup><sup>†</sup> (Q4265520) (← links)
- Coupling proximal methods and variational convergence (Q4277995) (← links)
- PENNON: A code for convex nonlinear and semidefinite programming (Q4457888) (← links)
- The perturbed Tikhonov's algorithm and some of its applications (Q4698889) (← links)
- (Q4763007) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- On the convergence of the proximal algorithm for saddle-point problems (Q4836766) (← links)
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS (Q5284943) (← links)