The following pages link to (Q3491338):
Displaying 50 items.
- Smooth minimization of non-smooth functions (Q128676) (← links)
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- Almost sure convergence of the forward-backward-forward splitting algorithm (Q276331) (← links)
- Implementation of augmented Lagrangian methods for equilibrium problems (Q283946) (← links)
- Stochastic forward-backward splitting for monotone inclusions (Q289110) (← links)
- Convergence rates with inexact non-expansive operators (Q312687) (← links)
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- On the worst case performance of the steepest descent algorithm for quadratic functions (Q344945) (← links)
- Locally optimal and heavy ball GMRES methods (Q346632) (← links)
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms (Q368722) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- A regularized gradient projection method for the minimization problem (Q410905) (← links)
- Containment control of multiagent systems with multiple leaders and noisy measurements (Q437527) (← links)
- Variant gradient projection methods for the minimization problems (Q448815) (← links)
- A Newton-penalty method for a simplified liquid crystal model (Q457675) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Solving proximal split feasibility problems without prior knowledge of operator norms (Q476276) (← links)
- On generalized Traub's method for absolute value equations (Q493062) (← links)
- Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
- Nearly optimal coverings of a sphere with generalized spherical segments (Q500603) (← links)
- Variable quasi-Bregman monotone sequences (Q501975) (← links)
- Variational analysis on local sharp minima via exact penalization (Q505627) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- Application of optimization methods for finding equilibrium states of two-dimensional crystals (Q518578) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Distributed stochastic subgradient projection algorithms for convex optimization (Q620442) (← links)
- A preconditioner for a kind of coupled FEM-BEM variational inequality (Q625922) (← links)
- A projection-proximal point algorithm for solving generalized variational inequalities (Q637563) (← links)
- Averaged mappings and the gradient-projection algorithm (Q639932) (← links)
- On convex optimization without convex representation (Q644504) (← links)
- Random algorithms for convex minimization problems (Q644912) (← links)
- Consistent learning by composite proximal thresholding (Q681492) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- Weak convergence of an iterative method for pseudomonotone variational inequalities and fixed-point problems (Q711697) (← links)
- The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222) (← links)
- Finite perturbation of convex programs (Q810372) (← links)
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
- On representations of the feasible set in convex optimization (Q845546) (← links)
- Sharp minima for multiobjective optimization in Banach spaces (Q858169) (← links)
- A new line search strategy for finding separating hyperplane in projection-based methods (Q891782) (← links)
- The Dines theorem and some other properties of quadratic mappings (Q904388) (← links)
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces (Q946377) (← links)
- \(p\)-factor methods for nonregular inequality-constrained optimization problems (Q960189) (← links)
- Convergence of direct methods for paramonotone variational inequalities (Q975354) (← links)
- A generalized Newton method for absolute value equations (Q1001330) (← links)
- Regularized Newton method for unconstrained convex optimization (Q1016344) (← links)
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities (Q1016351) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
