Convex programming in Hilbert space

Cites Work

Proximity Maps for Convex Sets
An Operator Theoretic Formulation of a Class of Control Problems and a Steepest Descent Method of Solution
Title not available (Why is that?)

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

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
Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
Convergence properties of inexact projected gradient methods
An improved projection method for solving generalized variational inequality problems
Convergent stepsizes for constrained optimization algorithms
An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities
A class of superlinearly convergent projection algorithms with relaxed stepsizes
A proximal point algorithm with asymmetric linear term
A regularization parameter selection model for total variation based image noise removal
Convergence analysis of an inexact three-operator splitting algorithm
Decentralized algorithm for centralized variational inequalities in network resource allocation
A least-distance programming procedure for minimization problems under linear constraints
A modified descent method for co-coercive variational inequalities
An improved Goldstein's type method for a class of variant variational inequalities
Inertial projected gradient method for large-scale topology optimization
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
Finite convergence of algorithms for nonlinear programs and variational inequalities
An inertial forward-backward algorithm for monotone inclusions
A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming

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)