The following pages link to (Q4077092):
Displaying 45 items.
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods (Q429465) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments (Q429466) (← links)
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators (Q461439) (← links)
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- A class of ADMM-based algorithms for three-block separable convex programming (Q721954) (← links)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- A proximal point-like method for symmetric finite element model updating problems (Q747223) (← links)
- Inequality systems and optimization (Q811410) (← links)
- Steplengths in the extragradient type methods (Q848547) (← links)
- Proximal-point algorithm using a linear proximal term (Q1028604) (← links)
- Newton's method for singular constrained optimization problems (Q1057627) (← links)
- A characterization of best complex rational approximants in a fundamental case (Q1099020) (← links)
- A cyclic projection algorithm via duality (Q1123132) (← links)
- Piecewise linear optimization (Q1143319) (← links)
- A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems (Q1145624) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- Zur Bewertung von Schätzungen bei der gewöhnlichen Regressionsanalyse (Q1151700) (← links)
- Estimating matrices (Q1161223) (← links)
- Comparing sweep strategies for stochastic relaxation (Q1176229) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- On the approximate solution of nonlinear variational inequalities (Q1236878) (← links)
- Higher order necessary conditions in abstract mathematical programming (Q1245155) (← links)
- Duality and regularization for inf-sup problems (Q1263076) (← links)
- On a class of iterative projection and contraction methods for linear programming (Q1321374) (← links)
- New contraction methods for linear inequalities (Q1334912) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation (Q1668721) (← links)
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems (Q1702597) (← links)
- On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- On inequality constrained generalized least squares selections in the general possibly singular Gauss-Markov model: A projector theoretical approach (Q1914240) (← links)
- A parallel splitting ALM-based algorithm for separable convex programming (Q2057225) (← links)
- On the iteration complexity of some projection methods for monotone linear variational inequalities (Q2397469) (← links)
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization (Q2430823) (← links)
- A proximal point algorithm revisit on the alternating direction method of multipliers (Q2441139) (← links)
- A variable metric proximal-descent algorithm for monotone operators (Q2511031) (← links)
- Generalized alternating direction method of multipliers: new theoretical insights and applications (Q2516351) (← links)
- On Haar's dual problem (Q2564337) (← links)
- A customized proximal point algorithm for convex minimization with linear constraints (Q2636606) (← links)
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem (Q2679571) (← links)
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes (Q3179612) (← links)
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing (Q3189422) (← links)
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging (Q3192655) (← links)
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming (Q6086848) (← links)
