The following pages link to (Q5704056):
Displaying 16 items.
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- An interior proximal point algorithm for nonlinear complementarity problems (Q708086) (← links)
- The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- An improved LQP-based method for solving nonlinear complementarity problems (Q2266828) (← links)
- A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods (Q2481370) (← links)
- A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming (Q3465935) (← links)
- Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size (Q5030635) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Enlargements: a bridge between maximal monotonicity and convexity (Q6200210) (← links)
