Pages that link to "Item:Q4090967"

The following pages link to On the Goldstein-Levitin-Polyak gradient projection method (Q4090967):

Displaying 44 items.

• Prior Learning and Convex-Concave Regularization of Binary Tomography (Q3439196) (← links)
• On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
• Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations (Q3458827) (← links)
• Adaptive Relevance Matrices in Learning Vector Quantization (Q3650550) (← links)
• Computational aspects of two-segment separable programming (Q3664835) (← links)
• Convex quadratic programming with one constraint and bounded variables (Q3771973) (← links)
• Projected gradient methods for linearly constrained problems (Q3773706) (← links)
• Exact penalty algorithm for optimal control problems with control and terminal constraints (Q3797774) (← links)
• Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation (Q4242780) (← links)
• A comparison of numerical methods for optimal shape design problems (Q4242975) (← links)
• Ergodic convergence in subgradient optimization (Q4391290) (← links)
• Strong convergence of projected reflected gradient methods for variational inequalities (Q4581230) (← links)
• Novel Algorithm for Non-Negative Matrix Factorization (Q4598034) (← links)
• Optimization of a Multiphysics Problem in Semiconductor Laser Design (Q4622880) (← links)
• Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems (Q4695015) (← links)
• Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques (Q4721121) (← links)
• A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
• Online Learning of a Weighted Selective Naive Bayes Classifier with Non-convex Optimization (Q5016640) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Newton projection method as applied to assembly simulation (Q5038434) (← links)
• An improved hyperplane projection method for generalized Nash equilibrium problems with extrapolation technique (Q5039391) (← links)
• An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems (Q5058384) (← links)
• Data-driven distributionally robust risk parity portfolio optimization (Q5058398) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)
• Proportioning with second-order information for model predictive control (Q5268930) (← 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)
• Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities (Q5959904) (← links)
• Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
• A gradient descent method for estimating the Markov chain choice model (Q6097386) (← links)
• Optimal Control of the Landau–de Gennes Model of Nematic Liquid Crystals (Q6135090) (← links)
• Quasi non-negative quaternion matrix factorization with application to color face recognition (Q6159019) (← links)
• A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem (Q6164562) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• Machine learning based iterative learning control for non‐repetitive time‐varying systems (Q6190208) (← links)
• The Potts model with different piecewise constant representations and fast algorithms: a survey (Q6606497) (← links)
• Multi-dimensional scaling from \(K\)-nearest neighbourhood distances (Q6608081) (← links)
• Lasso estimation of hierarchical interactions for analyzing heterogeneity of treatment effect (Q6628229) (← links)
• A class of projected-search methods for bound-constrained optimization (Q6640991) (← links)
• Reconstruction of Voronoi diagrams in inverse potential problems (Q6652882) (← links)
• The conditional maximum likelihood estimation for the Cox–Aalen model with doubly truncated data (Q6667632) (← links)