Pages that link to "Item:Q3773706"
From MaRDI portal
The following pages link to Projected gradient methods for linearly constrained problems (Q3773706):
Displaying 50 items.
- Distributed recursive projection identification with binary-valued observations (Q2070033) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- Multilevel selective harmonic modulation via optimal control (Q2084529) (← links)
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- Payoff landscapes and the robustness of selfish optimization in iterated games (Q2140026) (← links)
- General fixed-point method for solving the linear complementarity problem (Q2142788) (← links)
- Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Iterative methods for constrained convex minimization problem in Hilbert spaces (Q2249114) (← links)
- General iterative scheme based on the regularization for solving a constrained convex minimization problem (Q2250317) (← links)
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration (Q2284080) (← links)
- Stochastic structured tensors to stochastic complementarity problems (Q2307703) (← links)
- Reconstruction algorithm for unknown cavities via Feynman-Kac type formula (Q2340492) (← links)
- A projection descent method for solving variational inequalities (Q2342415) (← links)
- A modified spectral conjugate gradient projection algorithm for total variation image restoration (Q2345093) (← links)
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction (Q2350869) (← links)
- An additional projection step to He and Liao's method for solving variational inequalities (Q2370581) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- Modified descent-projection method for solving variational inequalities (Q2383915) (← links)
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
- A self-adaptive projection method with improved step-size for solving variational inequalities (Q2426902) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- Minimization of convex functions on the convex hull of a point set (Q2433235) (← links)
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm (Q2442634) (← links)
- On solving simple bilevel programs with a nonconvex lower level program (Q2452381) (← links)
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
- A projection method for a system of nonlinear monotone equations with convex constraints (Q2466785) (← links)
- The Lagrangian globalization method for nonsmooth constrained equations (Q2506171) (← links)
- A sequential quadratic programming method for potentially infeasible mathematical programs (Q2640450) (← links)
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense (Q2672733) (← links)
- Identification of ARMA models with binary-valued observations (Q2681369) (← links)
- Generic Minimizing Behavior in Semialgebraic Optimization (Q2789611) (← links)
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations (Q2795093) (← links)
- Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms (Q2817234) (← links)
- Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems (Q2827061) (← links)
- An orthogonal subspace minimization method for finding multiple solutions to the defocusing nonlinear Schrödinger equation with symmetry (Q2857475) (← links)
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations (Q2868903) (← links)
- On the convergence of an active-set method for ℓ<sub>1</sub>minimization (Q2905351) (← links)
- ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES (Q2919313) (← links)
- A posteriori error control for the binary Mumford-Shah model (Q2970099) (← links)
- A practical method for computing the largest<i>M</i>-eigenvalue of a fourth-order partially symmetric tensor (Q3011689) (← links)
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems (Q3167885) (← links)
- New effective projection method for variational inequalities problem (Q3194702) (← links)
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems (Q3426228) (← links)
- Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions (Q3432717) (← links)
- Convergence properties of inexact projected gradient methods (Q3446583) (← links)
- A convergence analysis result for constrained convex minimization problem (Q3453420) (← links)
