Convex programming in Hilbert space
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- A modified projection method with a new direction for solving variational inequalities
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- Convergent stepsizes for constrained optimization algorithms
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods
- A least-distance programming procedure for minimization problems under linear constraints
- Decomposition algorithm for convex differentiable minimization
- Solution of projection problems over polytopes
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Minimization methods with constraints
- Implementation of gradient methods by tangential discretization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A unified description of iterative algorithms for traffic equilibria
- Family of projected descent methods for optimization problems with simple bounds
- Convergence analysis of perturbed feasible descent methods
- Tseng type methods for solving inclusion problems and its applications
- Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
- Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Weak and strong convergence theorems for variational inequality problems
- Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription
- Efficient projected gradient methods for cardinality constrained optimization
- Prediction-correction method with BB step sizes
- Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces
- 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
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- On finite convergence and constraint identification of subgradient projection methods
- On the convergence of projected gradient processes to singular critical points
- Some recent advances in projection-type methods for variational inequalities
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- A cyclic projected gradient method
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- Dual fast projected gradient method for quadratic programming
- Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty
- A modified subgradient extragradient method for solving the variational inequality problem
- An extragradient method for solving variational inequalities without monotonicity
- Modified forward-backward splitting method for variational inclusions
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- The gradient projection method with Armijo's step size on manifolds
- A Tseng extragradient method for solving variational inequality problems in Banach spaces
- 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
- A PDE-constrained optimization approach for topology optimization of strained photonic devices
- A forward-backward-forward algorithm for solving quasimonotone variational inequalities
- Convergence analysis for variational inequalities and fixed point problems in reflexive Banach spaces
- 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)
- Conical averagedness and convergence analysis of fixed point algorithms
- 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
- Steepest-descent block-iterative methods for a finite family of quasi-nonexpansive mappings
- Optimal control methodology for the counter-terrorism strategies: the relaxation based approach
- A strong convergence algorithm for solving pseudomonotone variational inequalities with a single projection
- A novel projected gradient-like method for optimization problems with simple constraints
- Alternating forward-backward splitting for linearly constrained optimization problems
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- Gradient projection method on matrix manifolds
- An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
- Convex optimization techniques in compliant assembly simulation
- Synchronisation and control of proliferation in cycling cell population models with age structure
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- Strong convergence of a self-adaptive method for the split feasibility problem
- Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints
- On starting and stopping criteria for nested primal-dual iterations
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- A regularization parameter selection model for total variation based image noise removal
- A proximal point algorithm with asymmetric linear term
- Convergence analysis of an inexact three-operator splitting algorithm
- Stochastic optimization on social networks with application to service pricing
- Convergence analysis for the modified spectral projected subgradient method
- 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
- A first-order numerical approach to switched-mode systems optimization
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- A self-adaptive projection method with improved step-size for solving variational inequalities
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Global convergence of a modified gradient projection method for convex constrained problems
- An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities
- A new class of projection and contraction methods for solving variational inequality problems
- An improved Goldstein's type method for a class of variant variational inequalities
- A two-stage prediction-correction method for solving monotone variational inequalities
- A modified descent method for co-coercive variational inequalities
- A double projection method for solving variational inequalities without monotonicity
- On reconstructability of quadratic utility functions from the iterations in gradient methods
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods
- Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions
- A new modified forward-backward-forward algorithm for solving inclusion problems
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
- Primal-dual splittings as fixed point iterations in the range of linear operators
- Inexact gradient projection method with relative error tolerance
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)
