Pages that link to "Item:Q5957563"
From MaRDI portal
The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- A trust-region method with improved adaptive radius for systems of nonlinear equations (Q261542) (← links)
- Towards an objective feasibility pump for convex minlps (Q263161) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Optimization strategies for two-mode partitioning (Q265312) (← links)
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (Q267707) (← links)
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization (Q272601) (← links)
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Some modified conjugate gradient methods for unconstrained optimization (Q277201) (← links)
- New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
- A dwindling filter trust region algorithm for nonlinear optimization (Q279130) (← links)
- Spectral method and its application to the conjugate gradient method (Q279183) (← links)
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- Transformation-based preprocessing for mixed-integer quadratic programs (Q283953) (← links)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Comment on ``A new three-term conjugate gradient method for unconstrained problem'' (Q285045) (← links)
- A new error in variables model for solving positive definite linear system using orthogonal matrix decompositions (Q285053) (← links)
- An inertia-free filter line-search algorithm for large-scale nonlinear programming (Q288393) (← links)
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function (Q289075) (← links)
- An optimal parameter for Dai-Liao family of conjugate gradient methods (Q289129) (← links)
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints (Q295355) (← links)
- A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations (Q295877) (← links)
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study (Q297279) (← links)
- A modified scaling parameter for the memoryless BFGS updating formula (Q297561) (← links)
- A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization (Q297724) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- An improved self-adaptive constraint sequencing approach for constrained optimization problems (Q298788) (← links)
- Stochastic derivative-free optimization using a trust region framework (Q301671) (← links)
- Scaling damped limited-memory updates for unconstrained optimization (Q306311) (← links)
- A stabilized filter SQP algorithm for nonlinear programming (Q312472) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation (Q316170) (← links)
- Dynamic scaling on the limited memory BFGS method (Q319180) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Methods for solving the mean query execution time minimization problem (Q319820) (← links)
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- Multiple-path selection for new highway alignments using discrete algorithms (Q320693) (← links)
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
- The inexact-Newton via GMRES subspace method without line search technique for solving symmetric nonlinear equations (Q321382) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
