The following pages link to (Q3491338):
Displaying 50 items.
- Characterizations of linear suboptimality for mathematical programs with equilibrium constraints (Q1016353) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- Minimum principle sufficiency (Q1198327) (← links)
- On the global optimization properties of finite-difference local descent algorithms (Q1207044) (← links)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- An exterior point method for the convex programming problem (Q1321136) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Partial linearization methods in nonlinear programming (Q1321373) (← links)
- A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
- Perturbed steepest-descent technique in multiextremal problems (Q1359471) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Solving minimax problems: local smoothing versus global smoothing (Q1627481) (← links)
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems (Q1637356) (← links)
- Algorithms of inertial mirror descent in convex problems of stochastic optimization (Q1641948) (← links)
- Numerical procedures for anisotropic analysis of time-invariant systems and synthesis of suboptimal anisotropic controllers and filters (Q1641952) (← links)
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
- Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- Bounded perturbation resilience of extragradient-type methods and their applications (Q1677995) (← links)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems (Q1680973) (← links)
- Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm (Q1681783) (← links)
- Some properties of two-dimensional surjective \(p\)-homogeneous maps (Q1683027) (← links)
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions (Q1684913) (← links)
- Approximate ADMM algorithms derived from Lagrangian splitting (Q1687316) (← links)
- Simultaneous and semi-alternating projection algorithms for solving split equality problems (Q1688525) (← links)
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems (Q1689071) (← links)
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← links)
- Subgradient projectors: extensions, theory, and characterizations (Q1711098) (← links)
- A modified inertial shrinking projection method for solving inclusion problems and quasi-nonexpansive multivalued mappings (Q1715645) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization (Q1730794) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators (Q1739043) (← links)
- Efficient histogram dictionary learning for text/image modeling and classification (Q1741297) (← links)
- Control of \(M|M|1|N\) queue parameters under constraints (Q1742429) (← links)
- Necessary optimality conditions for switched systems (Q1743179) (← links)
- The global weak sharp minima with explicit exponents in polynomial vector optimization problems (Q1746026) (← links)
- An attack-defense model with inhomogeneous resources of the opponents (Q1746348) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
- Modified Fejér sequences and applications (Q1790672) (← links)
- On finite convergence and constraint identification of subgradient projection methods (Q1802955) (← links)
- An interior point multiplicative method for optimization under positivity constraints (Q1897269) (← links)
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities (Q1897456) (← links)
- Learning competitive market balance (Q1904634) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- Network games; adaptations to Nash-Cournot equilibrium (Q1918427) (← links)
- An interior proximal method for a class of quasimonotone variational inequalities (Q1935257) (← links)
