Pages that link to "Item:Q4187592"
From MaRDI portal
The following pages link to Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming (Q4187592):
Displayed 50 items.
- Partial inverse of a monotone operator (Q585088) (← links)
- An approximate proximal-extragradient type method for monotone variational inequalities (Q703662) (← links)
- General implicit variational inclusion problems based on \(A\)-maximal (\(m\))-relaxed monotonicity (AMRM) frameworks (Q732497) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
- Unified theory of augmented Lagrangian methods for constrained global optimization (Q839330) (← links)
- Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
- Proximal methods in reflexive Banach spaces without monotonicity (Q874955) (← links)
- Proximal point algorithms and generalized nonlinear variational problems (Q884159) (← links)
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization (Q911470) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
- On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators (Q929604) (← links)
- Augmented Lagrangian applied to convex quadratic problems (Q932544) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications (Q945170) (← links)
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (Q1021801) (← links)
- On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework (Q1026379) (← links)
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications (Q1039359) (← links)
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization (Q1041440) (← links)
- General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces (Q1041502) (← links)
- Duality and existence theory for nondifferentiable programming (Q1057190) (← links)
- A primal-dual projection method for solving systems of linear inequalities (Q1058270) (← links)
- More results on the convergence of iterative methods for the symmetric linear complementarity problem (Q1061019) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- Homotopy techniques in linear programming (Q1091937) (← links)
- Morse theory for some lower-\(C^ 2\) functions in finite dimension (Q1103860) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- Continuous regularized variable-metric proximal minimization method (Q1128415) (← links)
- Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
- Extended scenario analysis (Q1176855) (← links)
- A mixed formulation for frictional contact problems prone to Newton like solution methods (Q1191985) (← links)
- A necessary and sufficient condition for convergence of steepest descent approximation to accretive operator equations (Q1197402) (← links)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734) (← links)
- Application of the alternating direction method of multipliers to separable convex programming problems (Q1202587) (← links)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
- Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- Progressive regularization of variational inequalities and decomposition algorithms (Q1265010) (← links)
- Proximal methods in view of interior-point strategies (Q1265063) (← links)
- Prox-regularization and solution of ill-posed elliptic variational inequalities (Q1265616) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- The perturbed proximal point algorithm and some of its applications (Q1317307) (← links)