Pages that link to "Item:Q5957563"
From MaRDI portal
The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):
Displaying 50 items.
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- Performance indicators in multiobjective optimization (Q2030589) (← links)
- A diagonal PRP-type projection method for convex constrained nonlinear monotone equations (Q2031317) (← links)
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
- Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing (Q2034433) (← links)
- A modified hybrid conjugate gradient method for unconstrained optimization (Q2034936) (← links)
- New fourth- and sixth-order classes of iterative methods for solving systems of nonlinear equations and their stability analysis (Q2035507) (← links)
- Scaled three-term derivative-free methods for solving large-scale nonlinear monotone equations (Q2035527) (← links)
- A modified scaled spectral-conjugate gradient-based algorithm for solving monotone operator equations (Q2036038) (← links)
- An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
- A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
- An efficient line search trust-region for systems of nonlinear equations (Q2041134) (← links)
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
- On the global convergence of a new spectral residual algorithm for nonlinear systems of equations (Q2041876) (← links)
- A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems (Q2043170) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function (Q2044499) (← links)
- Compact representations of structured BFGS matrices (Q2044571) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- An augmented Lagrangian method for cardinality-constrained optimization problems (Q2046539) (← links)
- Sufficient descent Riemannian conjugate gradient methods (Q2046556) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications (Q2048835) (← links)
- FR-type algorithm for finding approximate solutions to nonlinear monotone operator equations (Q2048925) (← links)
- Spectral residual method for nonlinear equations on Riemannian manifolds (Q2052260) (← links)
- On solving double direction methods for convex constrained monotone nonlinear equations with image restoration (Q2052263) (← links)
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update (Q2052328) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- Two nonmonotone trust region algorithms based on an improved Newton method (Q2053070) (← links)
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems (Q2053210) (← links)
- A two-step improved Newton method to solve convex unconstrained optimization problems (Q2053267) (← links)
- On the asymptotic convergence and acceleration of gradient methods (Q2053340) (← links)
- Two limited-memory optimization methods with minimum violation of the previous secant conditions (Q2057221) (← links)
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers (Q2057229) (← links)
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints (Q2059164) (← links)
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications (Q2059821) (← links)
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity (Q2060902) (← links)
- On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization (Q2061320) (← links)
- Behavior of the combination of PRP and HZ methods for unconstrained optimization (Q2061360) (← links)
- Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations (Q2061399) (← links)
- A tensor trust-region model for nonlinear system (Q2061487) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations (Q2063152) (← links)
