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)

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
A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
Hierarchical minimization problems and applications
Consumption and investment under constraints
Linear convergence analysis of the use of gradient projection methods on total variation problems
Fixed point optimization algorithm and its application to network bandwidth allocation
On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
Column generation algorithms for nonlinear optimization. II: Numerical investigations
Application of quasi-nonexpansive operators to an iterative method for variational inequality
A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
On the finite termination of the gradient projection method
A two-stage prediction-correction method for solving monotone variational inequalities
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
An iterative solution of a variational inequality for certain monotone operators in Hilbert space
Self-adaptive projection method for co-coercive variational inequalities
A new iteration method for variational inequalities on the set of common fixed points for a finite family of quasi-pseudocontractions in Hilbert spaces
Synchronisation and control of proliferation in cycling cell population models with age structure
Bounded perturbation resilience of projected scaled gradient methods
Projected gradient methods for linearly constrained problems
On finite convergence and constraint identification of subgradient projection methods
On the convergence of projected gradient processes to singular critical points
Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions
An introduction to continuous optimization for imaging
Linear convergence of iterative soft-thresholding
Family of projected descent methods for optimization problems with simple bounds
Forward-backward penalty scheme for constrained convex minimization without inf-compactness
Inverse variational inequalities with projection-based solution methods
Some recent advances in projection-type methods for variational inequalities
Weak and strong convergence theorems for variational inequality problems
Monotone projected gradient methods for large-scale box-constrained quadratic programming
Nonlinear programming methods in the presence of noise
A new extragradient-like method for solving variational inequality problems
Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
New extragradient-type methods for solving variational inequalities
A modified projection method with a new direction for solving variational inequalities
Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
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

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)