Pages that link to "Item:Q4509759"
From MaRDI portal
The following pages link to Nonmonotone Spectral Projected Gradient Methods on Convex Sets (Q4509759):
Displaying 50 items.
- One-bit tensor completion via transformed tensor singular value decomposition (Q2242530) (← links)
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
- Cone complimentary-based numerical manifold method modeling frictional and cohesive contact problems (Q2245828) (← links)
- Globally convergent DC trust-region methods (Q2250078) (← links)
- A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
- Spectral gradient projection method for monotone nonlinear equations with convex constraints (Q2271390) (← links)
- Exact spectral-like gradient method for distributed optimization (Q2282815) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (Q2301011) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
- An efficient implementation of a trust region method for box constrained optimization (Q2346512) (← links)
- Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
- Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
- A secant-based Nesterov method for convex functions (Q2361131) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
- Optimal weed population control using nonlinear programming (Q2398149) (← links)
- A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
- Runge-Kutta-like scaling techniques for first-order methods in convex optimization (Q2400802) (← links)
- Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem (Q2403122) (← links)
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- Optimal design of multiphase composites under elastodynamic loading (Q2414625) (← links)
- The Uzawa-MBB type algorithm for nonsymmetric saddle point problems (Q2419575) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- Shape optimization for tumor location (Q2429052) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
- An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
- On the asymptotic behaviour of some new gradient methods (Q2487845) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems (Q2515287) (← links)
- Spectral gradient methods for linearly constrained optimization (Q2569199) (← links)
- An iteration method to solve multiple constrained least squares problems (Q2628358) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization (Q2634354) (← links)
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming (Q2636605) (← links)
- The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← links)
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints (Q2661684) (← links)
