Convex programming in Hilbert space
From MaRDI portal
Publication:5517445
DOI10.1090/S0002-9904-1964-11178-2zbMath0142.17101MaRDI QIDQ5517445
Publication date: 1964
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Some recent advances in projection-type methods for variational inequalities, Tseng type methods for solving inclusion problems and its applications, Some results on approximate solutions of variational inequality problems for inverse strongly monotone operators, Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping, A new explicit iteration method for a class of variational inequalities, Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations, Optimal control of the temperature in a catalytic converter, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities, Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization, On the convergence of the Sakawa-Shindo algorithm in stochastic control, Inexact proximal point method for general variational inequalities, An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach, A modified gradient projection algorithm for solving the elastic demand traffic assignment problem, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, Note on the modified relaxation CQ algorithm for the split feasibility problem, An active set algorithm for nonlinear optimization with polyhedral constraints, Family of projected descent methods for optimization problems with simple bounds, Weak and strong convergence theorems for variational inequality problems, Monotone projected gradient methods for large-scale box-constrained quadratic programming, A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix, Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription, Convergence analysis of perturbed feasible descent methods, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Forward-backward penalty scheme for constrained convex minimization without inf-compactness, A new extragradient-like method for solving variational inequality problems, Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods, Column generation algorithms for nonlinear optimization. II: Numerical investigations, A modified projection method for solving co-coercive variational inequalities, An inertial forward-backward algorithm for monotone inclusions, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, Some Goldstein's type methods for co-coercive variant variational inequalities, Inverse variational inequalities with projection-based solution methods, Iterative methods for solving variational inequalities in Euclidean space, A multivariate spectral projected gradient method for bound constrained optimization, An improved two-step method for solving generalized Nash equilibrium problems, New step lengths in projection method for variational inequality problems, Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping, 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, An implementable proximal point algorithmic framework for nuclear norm minimization, Applications of fixed-point and optimization methods to the multiple-set split feasibility problem, A least-distance programming procedure for minimization problems under linear constraints, Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty, Decomposition algorithm for convex differentiable minimization, Efficient projected gradient methods for cardinality constrained optimization, A new approximation of the matrix rank function and its application to matrix rank minimization, Prediction-correction method with BB step sizes, Decentralized algorithm for centralized variational inequalities in network resource allocation, Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces, 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, 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 modified subgradient extragradient method for solving the variational inequality problem, On the linear convergence of the alternating direction method of multipliers, A Kronecker approximation with a convex constrained optimization method for blind image restoration, Convex constrained optimization for large-scale generalized Sylvester equations, A generalized hybrid steepest-descent method for variational inequalities in Banach spaces, A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem, Modified self-adaptive projection method for solving pseudomonotone variational inequalities, A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, The asymptotic behavior of the composition of two resolvents, Convergence properties of nonmonotone spectral projected gradient methods, New extragradient-type methods for solving variational inequalities, Minimization methods with constraints, Solving variational inequalities by a modified projection method with an effective step-size, Convergence of a projected gradient method variant for quasiconvex objectives, Lagrangian penalization scheme with parallel forward-backward splitting, An extragradient method for solving variational inequalities without monotonicity, Implementation of gradient methods by tangential discretization, Linear convergence of iterative soft-thresholding, Modified forward-backward splitting method for variational inclusions, On finite convergence and constraint identification of subgradient projection methods, The gradient projection algorithm for smooth sets and functions in nonconvex case, Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping, A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem, A modified projection method with a new direction for solving variational inequalities, The gradient projection method with Armijo's step size on manifolds, On iterative algorithms for linear least squares problems with bound constraints, Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model, On the convergence of projected gradient processes to singular critical points, A Tseng extragradient method for solving variational inequality problems in Banach spaces, Some projection methods with the BB step sizes for variational inequalities, 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)\), A class of superlinearly convergent projection algorithms with relaxed stepsizes, Convergent stepsizes for constrained optimization algorithms, Error bounds and convergence analysis of feasible descent methods: A general approach, Finite convergence of algorithms for nonlinear programs and variational inequalities, On reconstructability of quadratic utility functions from the iterations in gradient methods, Interior-point gradient method for large-scale totally nonnegative least squares problems, A unified description of iterative algorithms for traffic equilibria, Newton projection method as applied to assembly simulation, An inertial projection and contraction method with a line search technique for variational inequality and fixed point problems, Convergence properties of inexact projected gradient methods, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Some Extragradient Methods for Solving Variational Inequalities Using Bregman Projection and Fixed Point Techniques in Reflexive Banach Spaces, Application of Quasi-Nonexpansive Operators to an Iterative Method for Variational Inequality, A Solver for Nonconvex Bound-Constrained Quadratic Optimization, Self-adaptive projection method for co-coercive variational inequalities, Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation, A Family of Supermemory Gradient Projection Methods for Constrained Optimization, On the rate of convergence of projected Barzilai–Borwein methods, Unnamed Item, An improved projection method for solving generalized variational inequality problems, Projected gradient algorithms for optimization over order simplices, 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, Random and cyclic projection algorithms for 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, 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, An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization, 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 novel projected gradient-like method for optimization problems with simple constraints, Alternating forward-backward splitting for linearly constrained optimization problems, Convex quadratic programming with one constraint and bounded variables, On the convergence of inertial two-subgradient extragradient method for variational inequality problems, Projected gradient methods for linearly constrained problems, A self-adaptive projection method with improved step-size for solving variational inequalities, Fixed point optimization algorithm and its application to network bandwidth allocation, The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions, A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization, Global convergence of a modified gradient projection method for convex constrained problems, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Primal-dual splittings as fixed point iterations in the range of linear operators, A survey on operator splitting and decomposition of convex programs, Outer Approximation Methods for Solving Variational Inequalities Defined over the Solution Set of a Split Convex Feasibility Problem, Outer approximation methods for solving variational inequalities in Hilbert space, Inexact gradient projection method with relative error tolerance, Gradient projection method on matrix manifolds, An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems, Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection, Unnamed Item, Convex optimization techniques in compliant assembly simulation, Optimization of a Multiphysics Problem in Semiconductor Laser Design, Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings, An extension of Curry's theorem to steepest descent in normed linear spaces, An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities, Synchronisation and control of proliferation in cycling cell population models with age structure, Unnamed Item, Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets, The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, An iterative solution of a variational inequality for certain monotone operators in Hilbert space, Unnamed Item, Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators, 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, Strong convergence of a self-adaptive method for the split feasibility problem, A modified descent method for co-coercive variational inequalities, Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints, An introduction to continuous optimization for imaging, Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings, 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, Nonlinear programming methods in the presence of noise, Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, A double projection method for solving variational inequalities without monotonicity, On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces, Unnamed Item, The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$, Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization, A regularization parameter selection model for total variation based image noise removal, A proximal point algorithm with asymmetric linear term, Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques, Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals, Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives, On projected alternating BB methods for variational inequalities, On the finite termination of the gradient projection method, On the linear convergence rate of a relaxed forward–backward splitting method, Convergence analysis of an inexact three-operator splitting algorithm, Adaptive Douglas--Rachford Splitting Algorithm from a Yosida Approximation Standpoint, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM, Hierarchical Minimization Problems and Applications, A new incremental constraint projection method for solving monotone variational inequalities, Conical averagedness and convergence analysis of fixed point algorithms, An inertial semi-forward-reflected-backward splitting and its application, Proximal Gradient Methods for Machine Learning and Imaging, Stochastic optimization on social networks with application to service pricing, Convergence analysis for the modified spectral projected subgradient method, An infeasible projection type algorithm for nonmonotone variational inequalities, Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity, A new low-cost feasible projection algorithm for pseudomonotone variational inequalities, Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning, A quasi-Newton trust-region method for optimization under uncertainty using stochastic simplex approximate gradients, Nonlinear forward-backward splitting with momentum correction, Unnamed Item, Forward-backward-forward algorithms involving two inertial terms for monotone inclusions, A gradient descent method for estimating the Markov chain choice model, Double inertial proximal gradient algorithms for convex optimization problems and applications, Inertial projected gradient method for large-scale topology optimization, An inertial projection and contraction method for solving bilevel quasimonotone variational inequality problems, Combined Newton-gradient method for constrained root-finding in chemical reaction networks, Solving monotone inclusions involving the sum of three maximally monotone operators and a cocoercive operator with applications, A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints, An elementary approach to tight worst case complexity analysis of gradient based methods, An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Consumption and investment under constraints, Consumption and investment under constraints, Improvements of some projection methods for monotone nonlinear variational inequalities, Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities, Bounded perturbation resilience of projected scaled gradient methods, Single Bregman projection method for solving variational inequalities in reflexive Banach spaces
Cites Work
