Pages that link to "Item:Q4951043"

The following pages link to Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels (Q4951043):

Displaying 48 items.

• LQP method with a new optimal step size rule for nonlinear complementarity problems (Q264934) (← links)
• An inexact proximal method for quasiconvex minimization (Q319853) (← links)
• An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
• Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
• Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder). (Q699507) (← 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)
• A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410) (← links)
• The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
• Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← 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)
• 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)
• A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657) (← links)
• Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
• Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← 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)
• 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)
• Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
• Modified proximal-point method for nonlinear complementarity problems (Q2433761) (← links)
• An LQP method for pseudomonotone variational inequalities (Q2433923) (← links)
• Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
• Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
• Interior projection-like methods for monotone variational inequalities (Q2570999) (← links)
• Building initial partitions through sampling techniques (Q2643942) (← links)
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization (Q2675734) (← links)
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
• A proximal multiplier method for separable convex minimization (Q2790892) (← links)
• Interior hybrid proximal extragradient methods for the linear monotone complementarity problem (Q2808328) (← links)
• A minimization algorithm for equilibrium problems with polyhedral constraints (Q2810110) (← links)
• Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
• Rescaled proximal methods for linearly constrained convex problems (Q3515390) (← links)
• A new predicto-corrector method for pseudomonotone nonlinear complementarity problems (Q3518550) (← links)
• Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming (Q4562766) (← links)
• An inexact algorithm with proximal distances for variational inequalities (Q4579889) (← links)
• An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
• (Q5241344) (← links)
• Weak and strong convergence of proximal penalization and proximal splitting algorithms for two-level hierarchical Ky Fan minimax inequalities (Q5248237) (← links)
• Primal–dual exterior point method for convex optimization (Q5459822) (← links)
• Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)
• Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier (Q6038640) (← links)
• Dislocation hyperbolic kernel function (Q6620698) (← links)