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
- On reconstructability of quadratic utility functions from the iterations in gradient methods
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- Convex constrained optimization for large-scale generalized Sylvester equations
- An implementable proximal point algorithmic framework for nuclear norm minimization
- A unified description of iterative algorithms for traffic equilibria
- On iterative algorithms for linear least squares problems with bound constraints
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Improvements of some projection methods for monotone nonlinear variational inequalities
- An active set algorithm for nonlinear optimization with polyhedral constraints
- An improved two-step method for solving generalized Nash equilibrium problems
- Convex quadratic programming with one constraint and bounded variables
- A new approximation of the matrix rank function and its application to matrix rank minimization
- Some results on approximate solutions of variational inequality problems for inverse strongly monotone operators
- Inexact proximal point method for general variational inequalities
- Implementation of gradient methods by tangential discretization
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- A PDE-constrained optimization approach for topology optimization of strained photonic devices
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Interior-point gradient method for large-scale totally nonnegative least squares problems
- Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- Convergence analysis of perturbed feasible descent methods
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- A new explicit iteration method for a class of variational inequalities
- A generalized hybrid steepest-descent method for variational inequalities in Banach spaces
- The asymptotic behavior of the composition of two resolvents
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators
- A multivariate spectral projected gradient method for bound constrained optimization
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Optimal control of the temperature in a catalytic converter
- Convergence of a projected gradient method variant for quasiconvex objectives
- On the linear convergence of the alternating direction method of multipliers
- Strong convergence of a self-adaptive method for the split feasibility problem
- On the convergence of the Sakawa-Shindo algorithm in stochastic control
- Solution of projection problems over polytopes
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- A survey on operator splitting and decomposition of convex programs
- Error bounds and convergence analysis of feasible descent methods: A general approach
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)