scientific article

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

minimax problem convergence rate continuous differentiability

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (only showing first 100 items - show all)

Minimum-support solutions of polyhedral concave programs^* ⋮ Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation ⋮ Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier ⋮ Differentially Private Accelerated Optimization Algorithms ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Riemannian optimization via Frank-Wolfe methods ⋮ Graph convergence with an application for system of variational inclusions and fixed-point problems ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ Convex and nonconvex sweeping processes with velocity constraints: well-posedness and insights ⋮ Correction to: ``A line search based proximal stochastic gradient algorithm with dynamical variance reduction ⋮ A line search based proximal stochastic gradient algorithm with dynamical variance reduction ⋮ A refined inertial DC algorithm for DC programming ⋮ Continuous time learning algorithms in optimization and game theory ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ Faster first-order primal-dual methods for linear programming using restarts and sharpness ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ Time rescaling of a primal-dual dynamical system with asymptotically vanishing damping ⋮ Accelerated gradient methods combining Tikhonov regularization with geometric damping driven by the Hessian ⋮ A practicable way for computing the directional derivative of the optimal value function in convex programming ⋮ On the Convergence of Stochastic Gradient Descent for Linear Inverse Problems in Banach Spaces ⋮ Two-step inertial forward-reflected-anchored-backward splitting algorithm for solving monotone inclusion problems ⋮ On the Convergence of Gradient-Like Flows with Noisy Gradient Input ⋮ Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Parameter Selection and Preconditioning for a Graph Form Solver ⋮ Newton-type Methods with Generalized Distances For Constrained Optimization ⋮ The Extragradient Method for Convex Optimization in the Presence of Computational Errors ⋮ Unnamed Item ⋮ Variance-penalized Markov decision processes: dynamic programming and reinforcement learning techniques ⋮ Ergodic convergence in subgradient optimization ⋮ NEWTONIAN MECHANICS AND NASH PLAY ⋮ A smart modelling for the casting temperature prediction in an electric arc furnace ⋮ Multicategory proximal support vector machine classifiers ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ New analysis and results for the Frank-Wolfe method ⋮ Multicategory proximal support vector machine classifiers ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm ⋮ Primal–dual exterior point method for convex optimization ⋮ Preconditioned gradient iterations for the eigenproblem of definite matrix pairs ⋮ On the ill-posedness of the trust region subproblem ⋮ Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression ⋮ Direct Search Based on Probabilistic Descent ⋮ On Subgradient Projectors ⋮ On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints ⋮ Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems ⋮ Convex Synthesis of Accelerated Gradient Algorithms ⋮ On the Convergence Rate of Incremental Aggregated Gradient Algorithms ⋮ Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization ⋮ Distributed Bregman-Distance Algorithms for Min-Max Optimization ⋮ A new incremental constraint projection method for solving monotone variational inequalities ⋮ Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization ⋮ Implicit regularization with strongly convex bias: Stability and acceleration ⋮ Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations ⋮ Proximal Gradient Methods for Machine Learning and Imaging ⋮ A proximal-based deomposition method for compositions method for convex minimization problems ⋮ Almost sure convergence of the forward-backward-forward splitting algorithm ⋮ Implementation of augmented Lagrangian methods for equilibrium problems ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ Stochastic forward-backward splitting for monotone inclusions ⋮ Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems ⋮ Convergence rates with inexact non-expansive operators ⋮ On representations of the feasible set in convex optimization ⋮ Algorithms of inertial mirror descent in convex problems of stochastic optimization ⋮ Numerical procedures for anisotropic analysis of time-invariant systems and synthesis of suboptimal anisotropic controllers and filters ⋮ An interior point multiplicative method for optimization under positivity constraints ⋮ On the convergence of projection methods: Application to the decomposition of affine variational inequalities ⋮ Perturbed steepest-descent technique in multiextremal problems ⋮ Learning competitive market balance ⋮ Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ On the worst case performance of the steepest descent algorithm for quadratic functions ⋮ Locally optimal and heavy ball GMRES methods ⋮ New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure ⋮ A Gauss-Newton method for convex composite optimization ⋮ A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms ⋮ Network games; adaptations to Nash-Cournot equilibrium ⋮ Adaptive restart of the optimized gradient method for convex optimization ⋮ Exact worst-case convergence rates of the proximal gradient method for composite convex minimization ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Bounded perturbation resilience of extragradient-type methods and their applications ⋮ On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions ⋮ On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems ⋮ Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm ⋮ Some properties of two-dimensional surjective \(p\)-homogeneous maps ⋮ A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions ⋮ A new line search strategy for finding separating hyperplane in projection-based methods ⋮ Approximate ADMM algorithms derived from Lagrangian splitting ⋮ First-order methods of smooth convex optimization with inexact oracle ⋮ Subgradient methods for huge-scale optimization problems ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ Simultaneous and semi-alternating projection algorithms for solving split equality problems ⋮ Distributed stochastic subgradient projection algorithms for convex optimization ⋮ An inexact proximal method with proximal distances for quasimonotone equilibrium problems ⋮ A regularized gradient projection method for the minimization problem ⋮ A preconditioner for a kind of coupled FEM-BEM variational inequality ⋮ The Dines theorem and some other properties of quadratic mappings ⋮ On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. ⋮ Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming

This page was built for publication: