Pages that link to "Item:Q5957563"
From MaRDI portal
The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):
Displaying 50 items.
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares (Q2106221) (← links)
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications (Q2106234) (← links)
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- Global optimization for the multilevel European gas market system with nonlinear flow models on trees (Q2114602) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems (Q2114830) (← links)
- Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
- Structured diagonal Gauss-Newton method for nonlinear least squares (Q2115053) (← links)
- An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications (Q2115085) (← links)
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing (Q2116059) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- SeaPearl: a constraint programming solver guided by reinforcement learning (Q2117242) (← links)
- Improving branch-and-bound using decision diagrams and reinforcement learning (Q2117248) (← links)
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications (Q2120795) (← links)
- A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications (Q2123242) (← links)
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
- An adaptive trust-region method without function evaluations (Q2125064) (← links)
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
- Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches (Q2125366) (← links)
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees (Q2125571) (← links)
- A new nonmonotone adaptive trust region algorithm. (Q2128413) (← links)
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery (Q2130839) (← links)
- Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application (Q2130906) (← links)
- An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration (Q2131452) (← links)
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
- First-order inertial algorithms involving dry friction damping (Q2133421) (← links)
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm (Q2138301) (← links)
- Circumcentering approximate reflections for solving the convex feasibility problem (Q2138461) (← links)
- Hybrid and enhanced PSO: novel first order reliability method-based hybrid intelligent approaches (Q2138767) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem (Q2139271) (← links)
- A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
- Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems (Q2142484) (← links)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
- A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization (Q2143221) (← links)
- Solving nonlinear monotone operator equations via modified SR1 update (Q2143842) (← links)
- On \(q\)-BFGS algorithm for unconstrained optimization problems (Q2144107) (← links)
- An active set quasi-Newton method with projection step for monotone nonlinear equations (Q2144849) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
