Pages that link to "Item:Q3220362"

The following pages link to Two-Metric Projection Methods for Constrained Optimization (Q3220362):

Displaying 47 items.

• Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
• A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints (Q2251725) (← links)
• Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming (Q2330654) (← links)
• On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
• A projection descent method for solving variational inequalities (Q2342415) (← links)
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates (Q2349844) (← links)
• A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring (Q2353428) (← links)
• Neural network models and its application for solving linear and quadratic programming problems (Q2369095) (← links)
• An additional projection step to He and Liao's method for solving variational inequalities (Q2370581) (← links)
• Modified descent-projection method for solving variational inequalities (Q2383915) (← links)
• Convergence rate of a modified extragradient method for pseudomonotone variational inequalities (Q2405481) (← links)
• Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces (Q2448177) (← links)
• A projection method for a system of nonlinear monotone equations with convex constraints (Q2466785) (← links)
• A simple self-adaptive alternating direction method for linear variational inequality problems (Q2519632) (← links)
• A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
• Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions (Q2677671) (← links)
• Primal-dual splittings as fixed point iterations in the range of linear operators (Q2694517) (← links)
• An automatic \(L_1\)-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks (Q2698074) (← links)
• Scaling techniques for gradient projection-type methods in astronomical image deblurring (Q2868153) (← links)
• An algorithm for finding an optimal projection of a symmetric matrix onto a diagonal matrix (Q2877086) (← links)
• Modified projection method for general variational inequalities (Q2919283) (← links)
• On a new numerical method for solving general variational inequalities (Q2919313) (← links)
• Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions (Q3432717) (← links)
• A convergence analysis result for constrained convex minimization problem (Q3453420) (← links)
• On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
• An algorithm for quadratic ℓ₁-regularized optimization with a flexible active-set strategy (Q3458840) (← links)
• Projected gradient methods for linearly constrained problems (Q3773706) (← links)
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)
• (Q4795311) (← links)
• A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)
• Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM (Q5013586) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• An Iterative Reduction FISTA Algorithm for Large-Scale LASSO (Q5088796) (← links)
• Convergence rate of a gradient projection method for solving variational inequalities (Q5090005) (← links)
• PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization (Q5161766) (← links)
• Globalization technique for projected Newton–Krylov methods (Q5273348) (← links)
• The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions (Q5363380) (← links)
• Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications (Q5420198) (← links)
• A potential reduction algorithm for linearly constrained convex programming (Q5953365) (← links)
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities (Q5959904) (← links)
• Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
• A Bregman–Kaczmarz method for nonlinear systems of equations (Q6492445) (← links)
• An efficient trust region algorithm with bounded iteration sequence for unconstrained optimization and its application in support vector machine (Q6572440) (← links)
• Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions (Q6659489) (← links)