Convex programming in Hilbert space
From MaRDI portal
Publication:5517445
DOI10.1090/S0002-9904-1964-11178-2zbMATH Open0142.17101MaRDI QIDQ5517445FDOQ5517445
Authors: Allen A. Goldstein
Publication date: 1964
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Cites Work
Cited In (only showing first 100 items - show all)
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- Consumption and investment under constraints
- Efficient projected gradient methods for cardinality constrained optimization
- Prediction-correction method with BB step sizes
- On the convergence of inertial two-subgradient extragradient method for variational inequality problems
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- A cyclic projected gradient method
- On starting and stopping criteria for nested primal-dual iterations
- An inertial semi-forward-reflected-backward splitting and its application
- An infeasible projection type algorithm for nonmonotone variational inequalities
- Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
- On the rate of convergence of projected Barzilai-Borwein methods
- Proximal Gradient Methods for Machine Learning and Imaging
- A new algorithm for variational inequality problems with a generalized phi-strongly monotone map over the set of common fixed points of a finite family of quasi-phi-nonexpansive maps, with applications
- An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
- A new projection algorithm for solving pseudo-monotone variational inequality and fixed point problems
- An extragradient method without monotonicity
- A quasi-Newton trust-region method for optimization under uncertainty using stochastic simplex approximate gradients
- Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
- Title not available (Why is that?)
- Optimal control methodology for the counter-terrorism strategies: the relaxation based approach
- An inertial projection and contraction method with a line search technique for variational inequality and fixed point problems
- Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings
- Outer approximation methods for solving variational inequalities defined over the solution set of a split convex feasibility problem
- Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
- A solver for nonconvex bound-constrained quadratic optimization
- A new class of projection and contraction methods for solving variational inequality problems
- A new incremental constraint projection method for solving monotone variational inequalities
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Single Bregman projection method for solving variational inequalities in reflexive Banach spaces
- Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint
- Modified forward-backward splitting method for variational inclusions
- Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription
- Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals
- Steepest-descent block-iterative methods for a finite family of quasi-nonexpansive mappings
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- Dual fast projected gradient method for quadratic programming
- A strong convergence algorithm for solving pseudomonotone variational inequalities with a single projection
- The gradient projection method with Armijo's step size on manifolds
- On projected alternating BB methods for variational inequalities
- Gradient projection method on matrix manifolds
- A first-order numerical approach to switched-mode systems optimization
- A Tseng extragradient method for solving variational inequality problems in Banach spaces
- 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
- Strong convergence of an inertial projection and contraction method with self adaptive stepsize for pseudomonotone variational inequalities and fixed point problems
- On the inexact scaled gradient projection method
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- On the linear convergence rate of a relaxed forward–backward splitting method
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- A forward-backward-forward algorithm for solving quasimonotone variational inequalities
- Convergence analysis for variational inequalities and fixed point problems in reflexive Banach spaces
- Alternating forward-backward splitting for linearly constrained optimization problems
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- Optimization of a Multiphysics Problem in Semiconductor Laser Design
- Four-operator splitting via a forward-backward-half-forward algorithm with line search
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\)
- Forward-backward-forward algorithms involving two inertial terms for monotone inclusions
- New forward backward splitting methods for solving pseudomonotone variational inequalities
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Modified self-adaptive projection method for solving pseudomonotone variational inequalities
- Decomposition algorithm for convex differentiable minimization
- An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
- Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces
- Convergence properties of nonmonotone spectral projected gradient methods
- Tseng type methods for solving inclusion problems and its applications
- A gradient descent method for estimating the Markov chain choice model
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach
- Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- Convex optimization techniques in compliant assembly simulation
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Lagrangian penalization scheme with parallel forward-backward splitting
- A modified subgradient extragradient method for solving the variational inequality problem
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods
- Conical averagedness and convergence analysis of fixed point algorithms
- A double projection method for solving variational inequalities without monotonicity
- An extragradient method for solving variational inequalities without monotonicity
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Gradient projection and conditional gradient methods for constrained nonconvex minimization
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- Minimization methods with constraints
- Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty
- Outer approximation methods for solving variational inequalities in Hilbert space
- A modified projection method for solving co-coercive variational inequalities
- Some Goldstein's type methods for co-coercive variant variational inequalities
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- An extension of Curry's theorem to steepest descent in normed linear spaces
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
- A self-adaptive projection method with improved step-size for solving variational inequalities
- Convergence analysis for the modified spectral projected subgradient method
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Some projection methods with the BB step sizes for variational inequalities
- Iterative methods for solving variational inequalities in Euclidean space
- New step lengths in projection method for variational inequality problems
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- Solving variational inequalities by a modified projection method with an effective step-size
This page was built for publication: Convex programming in Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5517445)