Pages that link to "Item:Q4376157"
From MaRDI portal
The following pages link to Convergence of Proximal-Like Algorithms (Q4376157):
Displaying 50 items.
- LQP method with a new optimal step size rule for nonlinear complementarity problems (Q264934) (← links)
- A descent LQP alternating direction method for solving variational inequality problems with separable structure (Q295243) (← links)
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- An inexact LQP alternating direction method for solving a class of structured variational inequalities (Q316538) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556) (← links)
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← links)
- Interior proximal method without the cutting plane property (Q493039) (← links)
- A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618) (← links)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods (Q623551) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- An interior proximal method in vector optimization (Q635150) (← links)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
- An interior proximal point algorithm for nonlinear complementarity problems (Q708086) (← links)
- The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
- A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410) (← links)
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities (Q842770) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities (Q853670) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- Competitive facility location on decentralized supply chains (Q1027530) (← links)
- Proximal-point algorithm using a linear proximal term (Q1028604) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem (Q1734367) (← links)
- On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators (Q1873664) (← links)
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- Algorithms for stochastic optimization with function or expectation constraints (Q2181600) (← links)
- On LQP alternating direction method for solving variational inequality problems with separable structure (Q2258745) (← links)
- Parallel LQP alternating direction method for solving variational inequality problems with separable structure (Q2263371) (← links)
- Self-adaptive projection-based prediction-correction method for constrained variational inequalities (Q2266827) (← links)
- Solving a class of constrained `black-box' inverse variational inequalities (Q2267639) (← links)
