scientific article; zbMATH DE number 3293978
From MaRDI portal
Publication:5576518
zbMath0184.38902MaRDI QIDQ5576518
E. S. Levitin, Boris T. Polyak
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A method of bi-coordinate variations with tolerances and its convergence, A limited memory quasi-Newton trust-region method for box constrained optimization, On the convexity of integrals of multivalued mappings. Applications in control theory, Mann type iterative methods for finding a common solution of split feasibility and fixed point problems, Linearly convergent away-step conditional gradient for non-strongly convex functions, A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods, Uniform convexity and the splitting problem for selections, Convergence analysis of two-step inertial Douglas-Rachford algorithm and application, A projected Newton method for minimization problems with nonlinear inequality constraints, Optimal control of the temperature in a catalytic converter, Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities, A modified gradient projection algorithm for solving the elastic demand traffic assignment problem, An active set algorithm for nonlinear optimization with polyhedral constraints, Extended semismooth Newton method for functions with values in a cone, Existence of solution in thickness optimization problem for a plate, Application of the conditional gradient method to resource allocation in wireless networks, A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix, One approach to constructing cutting algorithms with dropping of cutting planes, Least-norm linear programming solution as an unconstrained minimization problem, A linear separability criterion for sets of Euclidean space, Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems, Newton's method and its use in optimization, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, Explicit bounds for rational points near planar curves and metric Diophantine approximation, Column generation algorithms for nonlinear optimization. II: Numerical investigations, Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size, Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, Alternating forward-backward splitting for linearly constrained optimization problems, Iterative methods for solving variational inequalities in Euclidean space, New step lengths in projection method for variational inequality problems, Linear convergence analysis of the use of gradient projection methods on total variation problems, Dual fast projected gradient method for quadratic programming, On properties of supporting and quasi-supporting vectors, Averaged mappings and the gradient-projection algorithm, Applications of fixed-point and optimization methods to the multiple-set split feasibility problem, Gradient projection method on matrix manifolds, Computer-aided design via optimization: A review, Strong convexity of sets and functions, On the gradient projection method for weakly convex functions on a proximally smooth set, Approximation of zeros of inverse strongly monotone operators in Banach spaces, Projection methods, isotone projection cones, and the complementarity problem, There is no variational characterization of the cycles in the method of periodic projections, Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem, Variable metric techniques for forward-backward methods in imaging, Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty, On solving of constrained convex minimize problem using gradient projection method, Decomposition algorithm for convex differentiable minimization, A new approximation of the matrix rank function and its application to matrix rank minimization, Prediction-correction method with BB step sizes, Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces, On the linear convergence rates of exchange and continuous methods for total variation minimization, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, Primal and dual predicted decrease approximation methods, Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs, On the linear convergence of the alternating direction method of multipliers, Iterative methods for constrained convex minimization problem in Hilbert spaces, A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces, A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem, Algorithm model for penalty functions-type iterative pcedures, Some applications of mathematical programming to problems in mathematical physics, The asymptotic behavior of the composition of two resolvents, A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems, Estimate of the modulus of continuity of the operator grad F, Weakly convex sets and modulus of nonconvexity, Conditional gradient method for multiobjective optimization, Convergence of a projected gradient method variant for quasiconvex objectives, An outer approximations algorithm for computer-aided design problems, The gradient projection algorithm for smooth sets and functions in nonconvex case, Error bound analysis of the D-gap functions for a class of elliptic variational inequalities with applications to frictional contact mechanics, A geometric analysis of Renegar's condition number, and its interplay with conic curvature, Approximate solution of the discrete optimal control problem, A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem, Algorithms for some minimax problems, Sufficiency criteria and duality for nonlinear programs involving n-set functions, Uniformly convex and uniformly smooth convex functions, A regularization parameter selection model for total variation based image noise removal, The gradient projection method with Armijo's step size on manifolds, Complexity of linear minimization and projection on some sets, Well-posed minimum problems for preorders, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, Extension of Newton's method to nonlinear functions with values in a cone, Cutting plane algorithms and state space constrained linear optimal control problems, Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities, On the inexact scaled gradient projection method, Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods, A PDE-constrained optimization approach for topology optimization of strained photonic devices, Über eine Penalty-Methode, Nonwastefulness of interior iterative procedures, Hybrid methods for network equilibrium problems, A two-stage cutting-plane method for conditional minimizing function, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Optimization of stochastic jump diffusion systems nonlinear in the control, An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint, Monotonicity of metric projection onto positive cones of ordered Euclidean spaces, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, A unified description of iterative algorithms for traffic equilibria, Restarting Frank-Wolfe: faster rates under Hölderian error bounds, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces, Descent methods for monotone equilibrium problems in Banach spaces, On the Frank–Wolfe algorithm for non-compact constrained optimization problems, Newton projection method as applied to assembly simulation, Proximal Splitting Methods in Signal Processing, The Cyclic Block Conditional Gradient Method for Convex Optimization Problems, A Solver for Nonconvex Bound-Constrained Quadratic Optimization, FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods, An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization, A smoothing projected HS method for solving stochastic tensor complementarity problem, Universal Conditional Gradient Sliding for Convex Optimization, Affine Invariant Convergence Rates of the Conditional Gradient Method, Nonlinear forward-backward splitting with momentum correction, Unnamed Item, Forward-backward-forward algorithms involving two inertial terms for monotone inclusions, Optimal state manipulation for a two-qubit system driven by coherent and incoherent controls, The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution, Identification of contact pressures between deformable bodies by combining Finite elements and a novel hybrid minimization strategy, An elementary approach to tight worst case complexity analysis of gradient based methods, First-order methods for convex optimization, The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions, Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection, Unnamed Item, Unnamed Item, Optimization of a Multiphysics Problem in Semiconductor Laser Design, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Nonlinear programming methods in the presence of noise, New analysis and results for the Frank-Wolfe method, The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy, Essentials of numerical nonsmooth optimization, Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization, Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization, Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques, On the finite termination of the gradient projection method, Scalable Semidefinite Programming, Split Feasibility and Fixed Point Problems, Essentials of numerical nonsmooth optimization, Proximal Gradient Methods for Machine Learning and Imaging, A dual differentiable exact penalty function
