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.
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
- A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems (Q2290912) (← links)
- A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces (Q2300001) (← links)
- A first-order image denoising model for staircase reduction (Q2305567) (← links)
- A proximal point algorithm with asymmetric linear term (Q2311109) (← links)
- A proximal alternating direction method for multi-block coupled convex optimization (Q2313761) (← links)
- An augmented Lagrangian decomposition method for block diagonal linear programming problems (Q2314414) (← links)
- Convergence analysis of the relaxed proximal point algorithm (Q2319250) (← links)
- A new implementable prediction-correction method for monotone variational inequalities with separable structure (Q2319291) (← links)
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming (Q2330654) (← links)
- An accelerated augmented Lagrangian method for multi-criteria optimization problem (Q2338456) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint (Q2347563) (← links)
- Dynamic method of multipliers in terminal control (Q2354502) (← links)
- Fast projected gradient method for support vector machines (Q2358069) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
- Dual coordinate ascent methods for non-strictly convex minimization (Q2368079) (← links)
- A class of augmented Lagrangians for equality constraints in nonlinear programming problems (Q2369125) (← links)
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach (Q2379691) (← links)
- Generalized over-relaxed proximal algorithm based ona-maximal monotonicity framework and applications to inclusion problems (Q2390187) (← links)
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM (Q2398479) (← links)
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers (Q2401513) (← links)
- The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
- Strong convergence of a general iterative algorithm for a finite family of accretive operators in Banach spaces (Q2406160) (← links)
- On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method (Q2407467) (← links)
- A numerical study of a mean curvature denoising model using a novel augmented Lagrangian method (Q2408415) (← links)
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
- AIC for the non-concave penalized likelihood method (Q2414941) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← links)
- A nonconvex model with minimax concave penalty for image restoration (Q2420696) (← links)
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
- Block-wise ADMM with a relaxation factor for multiple-block convex programming (Q2422129) (← links)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
- Simulation of unilateral constrained systems with many bodies (Q2433195) (← links)
- The Moreau envelope approach for the L1/TV image denoising model (Q2437921) (← links)
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints (Q2438398) (← links)
- A proximal point algorithm revisit on the alternating direction method of multipliers (Q2441139) (← links)
- An inexact alternating direction method for solving a class of structured variational inequalities (Q2451382) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Numerical aspects of non-smooth multibody dynamics (Q2459190) (← links)
- An APPA-based descent method with optimal step-sizes for monotone variational inequalities (Q2462142) (← links)
- A hybrid proximal point algorithm based on the \((A,\eta )\)-maximal monotonicity framework (Q2469703) (← links)
- Comparison of two proximal point algorithms for monotone variational inequalities (Q2469901) (← links)
- Self-adaptive inexact proximal point methods (Q2479838) (← links)
- Rockafellar's celebrated theorem based on \(A\)-maximal monotonicity design (Q2483142) (← links)
- Generalized partially relaxed pseudomonotone variational inequalities and general auxiliary problem principle (Q2491544) (← links)
- Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)