scientific article; zbMATH DE number 3293978

zbMATH Open0184.38902MaRDI QIDQ5576518FDOQ5576518

Authors: E. S. Levitin, Boris T. Polyak 

Publication date: 1966

Title of this publication is not available (Why is that?)

zbMATH Keywords

numerical analysis

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

Cited In (only showing first 100 items - show all)

• Über eine Penalty-Methode
• Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
• A projected Newton method for minimization problems with nonlinear inequality constraints
• On solving of constrained convex minimize problem using gradient projection method
• Prediction-correction method with BB step sizes
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• Decomposition algorithm for convex differentiable minimization
• Proximal Gradient Methods for Machine Learning and Imaging
• Essentials of numerical nonsmooth optimization
• Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
• A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
• Uniformly convex and uniformly smooth convex functions
• A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
• A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
• A dual differentiable exact penalty function
• Variable metric techniques for forward-backward methods in imaging
• Conditional gradient method for multiobjective optimization
• A solver for nonconvex bound-constrained quadratic optimization
• A two-stage cutting-plane method for conditional minimizing function
• Extended semismooth Newton method for functions with values in a cone
• On the gradient projection method for weakly convex functions on a proximally smooth set
• Error bound analysis of the D-gap functions for a class of elliptic variational inequalities with applications to frictional contact mechanics
• A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
• Iterative methods for solving variational inequalities in Euclidean space
• New step lengths in projection method for variational inequality problems
• Dual fast projected gradient method for quadratic programming
• On the linear convergence rates of exchange and continuous methods for total variation minimization
• The gradient projection method with Armijo's step size on manifolds
• Complexity of linear minimization and projection on some sets
• On the Frank-Wolfe algorithm for non-compact constrained optimization problems
• Gradient projection method on matrix manifolds
• The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
• Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities
• On the inexact scaled gradient projection method
• Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
• Effective method for constrained minimum - reverse bridge theorem
• Cutting plane algorithms and state space constrained linear optimal control problems
• Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
• Scalable semidefinite programming
• Alternating forward-backward splitting for linearly constrained optimization problems
• Existence of solution in thickness optimization problem for a plate
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
• Algorithm model for penalty functions-type iterative pcedures
• Some applications of mathematical programming to problems in mathematical physics
• On the convexity of integrals of multivalued mappings. Applications in control theory
• Nonwastefulness of interior iterative procedures
• Hybrid methods for network equilibrium problems
• Convergence analysis of two-step inertial Douglas-Rachford algorithm and application
• Optimization of stochastic jump diffusion systems nonlinear in the control
• Estimate of the modulus of continuity of the operator grad F
• Restarting Frank-Wolfe: faster rates under Hölderian error bounds
• An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
• 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
• On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression
• Farthest distance function to strongly convex sets
• Various perturbations and relaxations of the sweeping process
• A smoothing projected HS method for solving stochastic tensor complementarity problem
• A new modified two-subgradient extragradient algorithm for solving variational inequality problems
• Universal Conditional Gradient Sliding for Convex Optimization
• Optimal state manipulation for a two-qubit system driven by coherent and incoherent controls
• Generalized conditional gradient with augmented Lagrangian for composite minimization
• Affine Invariant Convergence Rates of the Conditional Gradient Method
• The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution
• Nonlinear forward-backward splitting with momentum correction
• Newton projection method as applied to assembly simulation
• Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods
• An improved subgradient extragradient self-adaptive algorithm based on the golden ratio technique for variational inequality problems in Banach spaces
• Optimization of a Multiphysics Problem in Semiconductor Laser Design
• Forward-backward-forward algorithms involving two inertial terms for monotone inclusions
• An optimal-storage approach to semidefinite programming using approximate complementarity
• Essentials of numerical nonsmooth optimization
• On finite convergence of iterative methods for variational inequalities in Hilbert spaces
• Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
• A unified description of iterative algorithms for traffic equilibria
• A method of bi-coordinate variations with tolerances and its convergence
• A limited memory quasi-Newton trust-region method for box constrained optimization
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• An active set algorithm for nonlinear optimization with polyhedral constraints
• Averaged mappings and the gradient-projection algorithm
• An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
• First-order methods for convex optimization
• Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
• A new approximation of the matrix rank function and its application to matrix rank minimization
• Descent methods for monotone equilibrium problems in Banach spaces
• Uniform convexity and the splitting problem for selections
• Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces
• Computer-aided design via optimization: A review
• Algorithms for some minimax problems
• The cyclic block conditional gradient method for convex optimization problems
• Proximal splitting methods in signal processing
• The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
• A PDE-constrained optimization approach for topology optimization of strained photonic devices
• Operator splitting performance estimation: tight contraction factors and optimal parameter selection
• Approximate solution of the discrete optimal control problem
• Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems
• The gradient projection algorithm for smooth sets and functions in nonconvex case
• Projection methods, isotone projection cones, and the complementarity problem
• The asymptotic behavior of the composition of two resolvents

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576518)