Pages that link to "Item:Q3773706"

The following pages link to Projected gradient methods for linearly constrained problems (Q3773706):

Displaying 48 items.

• On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
• OPTIMAL TREATMENT PLANNING IN RADIOTHERAPY BASED ON BOLTZMANN TRANSPORT CALCULATIONS (Q3521623) (← links)
• Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms (Q3565458) (← links)
• The Minimax Solution of Linear Equations Subject to Linear Constraints (Q3831928) (← links)
• (Q3978055) (← links)
• Ergodic convergence in subgradient optimization (Q4391290) (← links)
• Parameter Selection and Preconditioning for a Graph Form Solver (Q4625760) (← links)
• A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
• A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)
• A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
• Global convergence and finite termination of a class of smooth penalty function algorithms (Q4924100) (← links)
• An iterative method and weak sharp solutions for multitime-type variational inequalities (Q4958376) (← links)
• Large‐margin classification with multiple decision rules (Q4970185) (← links)
• On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate (Q4972545) (← links)
• An improved generalized flexibility matrix approach for structural damage detection (Q4991494) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• Newton projection method as applied to assembly simulation (Q5038434) (← links)
• Partial Smoothness and Constant Rank (Q5067431) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
• Lower bounds for ground states of condensed matter systems (Q5137616) (← links)
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
• A projection and contraction method for symmetric cone complementarity problem (Q5238193) (← links)
• Globalization technique for projected Newton–Krylov methods (Q5273348) (← links)
• FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK (Q5358086) (← links)
• The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions (Q5363380) (← links)
• Projected Gradient Methods for Nonnegative Matrix Factorization (Q5441321) (← links)
• An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (Q5691011) (← links)
• Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems (Q5739606) (← links)
• Tangent projection equations and general variational inequalities (Q5940345) (← links)
• Unified framework of extragradient-type methods for pseudomonotone variational inequalities. (Q5956973) (← links)
• A smoothing projected HS method for solving stochastic tensor complementarity problem (Q6046866) (← links)
• A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery (Q6064039) (← links)
• A gradient descent method for estimating the Markov chain choice model (Q6097386) (← links)
• On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
• Threshold selection and resource allocation for quantized identification (Q6130963) (← links)
• Asymptotic consensus of multi-agent systems under binary-valued observations and observation uncertainty (Q6131452) (← links)
• Quasi non-negative quaternion matrix factorization with application to color face recognition (Q6159019) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
• Sensitivity of inverse advection-diffusion-reaction to sensor and control: a low computational cost tool (Q6553556) (← links)
• Projected fixed point iterative method for large and sparse horizontal linear complementarity problem (Q6572394) (← links)
• Asymptotically efficient quasi-Newton type identification with quantized observations under bounded persistent excitations (Q6574466) (← links)
• Sparse recovery under nonnegativity and sum-to-one constraints (Q6576943) (← links)
• Adaptive tracking control under quantized observations and observation uncertainty with unbounded variance (Q6583332) (← links)
• On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems (Q6635808) (← links)
• A class of projected-search methods for bound-constrained optimization (Q6640991) (← links)
• An active set method for bound-constrained optimization (Q6661109) (← links)