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

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, Stability analysis for composite optimization problems and parametric variational systems, Local stability and local convergence of the basic trust-region method, Necessary and sufficient KKT optimality conditions in non-convex optimization, Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds, A new class of distributed optimization algorithms: application to regression of distributed data, A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, First-order optimization algorithms via inertial systems with Hessian driven damping, First-order inertial algorithms involving dry friction damping, Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces, Asymptotic behavior of second-order dissipative evolution equations combining potential with non-potential effects, The Cyclic Block Conditional Gradient Method for Convex Optimization Problems, Convergence of inexact quasisubgradient methods with extrapolation, Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics, Stochastic intermediate gradient method for convex optimization problems, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, Efficient unconstrained black box optimization, A frequency-domain analysis of inexact gradient methods, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization, Random gradient-free minimization of convex functions, Randomization and entropy in machine learning and data processing, Second-order optimality conditions for nonlinear programs and mathematical programs, Forward-backward splitting with Bregman distances, A mixed finite differences scheme for gradient approximation, An optimal subgradient algorithm with subspace search for costly convex optimization problems, Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients, MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications, Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings, Behavior of accelerated gradient methods near critical points of nonconvex functions, Convexification for a 1D hyperbolic coefficient inverse problem with single measurement data, Fast convergence of inertial gradient dynamics with multiscale aspects, A projection subgradient method for solving optimization with variational inequality constraints, Pseudomonotone operators and the Bregman proximal point algorithm, The effect of deterministic noise in subgradient methods, Linear complementarity as absolute value equation solution, Long time behaviour and stationary regime of memory gradient diffusions, Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme, Non-monotone Behavior of the Heavy Ball Method, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Absolute value equation solution via concave minimization, A review of nonlinear FFT-based computational homogenization methods, Distributed convex optimization with coupling constraints over time-varying directed graphs, Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems, Modified hybrid projection methods with SP iterations for quasi-nonexpansive multivalued mappings in Hilbert spaces, Aggregate subgradient method for nonsmooth DC optimization, Nonmonotone projected gradient methods based on barrier and Euclidean distances, 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization, A geometric framework for nonconvex optimization duality using augmented Lagrangian functions, Weiszfeld's method: old and new results, Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors, Proximal interior point method for convex semi-infinite programming, Nonparametric Recursive Variance Estimation, About regularity of collections of sets, Single-forward-step projective splitting: exploiting cocoercivity, A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators, A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems, Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants, Lower bounds for cubic optimization over the sphere, On a class of constrained interval-valued optimization problems governed by mechanical work cost functionals, General convergence analysis of stochastic first-order methods for composite optimization, Generalized Proximal Distances for Bilevel Equilibrium Problems, A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem, Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions, Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization, On critical points of the difference of two maximal monotone operators, On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems, Conjugate Mixture Models for Clustering Multimodal Data, Static controller synthesis for peak-to-peak gain minimization as an optimization problem, A Variable Metric Forward-Backward Method with Extrapolation, Empirical Likelihood Inference for the Rao‐Hartley‐Cochran Sampling Design, Shrinking projection methods involving inertial forward-backward splitting methods for inclusion problems, Asymptotic equivalence of evolution equations governed by cocoercive operators and their forward discretizations, A new two-step iterative method for solving absolute value equations, On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes, New inertial proximal gradient methods for unconstrained convex optimization problems, On the inexact scaled gradient projection method, A piecewise conservative method for unconstrained convex optimization, Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods, An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization, Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Newton-Kantorovich method and its global convergence, GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING, A geometric integration approach to nonsmooth, nonconvex optimisation, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, A control-theoretic perspective on optimal high-order optimization, Maximizing sum of coupled traces with applications, Robust consensus for multi-agent systems over unbalanced directed networks, Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions, A splitting algorithm for coupled system of primal-dual monotone inclusions, A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization, Quasi-monotone subgradient methods for nonsmooth convex minimization, Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis, Adaptive restart for accelerated gradient schemes, An infeasible projection type algorithm for nonmonotone variational inequalities, 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, A projection-proximal point algorithm for solving generalized variational inequalities, Containment control of multiagent systems with multiple leaders and noisy measurements, Averaged mappings and the gradient-projection algorithm, On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes, Subgradient projectors: extensions, theory, and characterizations, Variant gradient projection methods for the minimization problems, On convex optimization without convex representation, Random algorithms for convex minimization problems, A modified inertial shrinking projection method for solving inclusion problems and quasi-nonexpansive multivalued mappings, A Newton-penalty method for a simplified liquid crystal model, Learning in games with continuous action sets and unknown payoff functions, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, Solving proximal split feasibility problems without prior knowledge of operator norms, Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, On generalized Traub's method for absolute value equations, Finite termination of inexact proximal point algorithms in Hilbert spaces, Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators, Efficient histogram dictionary learning for text/image modeling and classification, Nearly optimal coverings of a sphere with generalized spherical segments, Control of \(M|M|1|N\) queue parameters under constraints, Variable quasi-Bregman monotone sequences, The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces, Necessary optimality conditions for switched systems, Variational analysis on local sharp minima via exact penalization, The global weak sharp minima with explicit exponents in polynomial vector optimization problems, An attack-defense model with inhomogeneous resources of the opponents, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Consistent learning by composite proximal thresholding, DC programming and DCA: thirty years of developments, Application of optimization methods for finding equilibrium states of two-dimensional crystals, Minimum principle sufficiency, Exterior point algorithms for nearest points and convex quadratic programs, \(p\)-factor methods for nonregular inequality-constrained optimization problems, On the global optimization properties of finite-difference local descent algorithms, Convergence of direct methods for paramonotone variational inequalities, Interior proximal method for variational inequalities: Case of nonparamonotone operators, Weak convergence of an iterative method for pseudomonotone variational inequalities and fixed-point problems, The generalized proximal point algorithm with step size 2 is not necessarily convergent, Stochastic intermediate gradient method for convex problems with stochastic inexact oracle, Modified Fejér sequences and applications, Smooth minimization of non-smooth functions, A generalized Newton method for absolute value equations, On finite convergence and constraint identification of subgradient projection methods, Regularized Newton method for unconstrained convex optimization, Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities, Two ``well-known properties of subgradient optimization, Characterizations of linear suboptimality for mathematical programs with equilibrium constraints, Subgradient methods for saddle-point problems, On the projected subgradient method for nonsmooth convex optimization in a Hilbert space, A variable-penalty alternating directions method for convex optimization, Finite perturbation of convex programs, An exterior point method for the convex programming problem, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Partial linearization methods in nonlinear programming, Primal recovery from consensus-based dual decomposition for distributed convex optimization