Pages that link to "Item:Q5957563"

The following pages link to Benchmarking optimization software with performance profiles. (Q5957563):

Displaying 50 items.

• A block version of left-looking AINV preconditioner with one by one or two by two block pivots (Q2009267) (← links)
• Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
• A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
• Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
• Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
• Subspace-stabilized sequential quadratic programming (Q2012234) (← links)
• A smoothing Newton method for absolute value equation associated with second-order cone (Q2012620) (← links)
• Some nonlinear conjugate gradient methods based on spectral scaling secant equations (Q2013630) (← links)
• Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization (Q2013811) (← links)
• A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations (Q2013818) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• A new trust region method for solving least-square transformation of system of equalities and inequalities (Q2017830) (← links)
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
• Simple algorithms for optimization on Riemannian manifolds with constraints (Q2019906) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
• Circumcentered methods induced by isometries (Q2022432) (← links)
• A variation of Broyden class methods using Householder adaptive transforms (Q2023660) (← links)
• Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation (Q2023682) (← links)
• Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
• On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations (Q2026773) (← links)
• An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem (Q2026775) (← links)
• Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
• Efficient large scale global optimization through clustering-based population methods (Q2027033) (← links)
• Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• Improved conjugate gradient method for nonlinear system of equations (Q2027665) (← links)
• Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems (Q2028038) (← links)
• A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games (Q2028466) (← links)
• Conditional gradient method for multiobjective optimization (Q2028470) (← links)
• Secant update generalized version of PSB: a new approach (Q2028481) (← links)
• An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
• A derivative-free \textit{RMIL} conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing (Q2029136) (← links)
• Stochastic single-allocation hub location (Q2029287) (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control (Q2029652) (← links)