Pages that link to "Item:Q5957563"

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

Displaying 50 items.

• Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application (Q2065023) (← links)
• A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
• Improved models for operation modes of complex compressor stations (Q2067256) (← links)
• The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique (Q2067951) (← links)
• A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications (Q2068628) (← links)
• Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
• A class of new derivative-free gradient type methods for large-scale nonlinear systems of monotone equations (Q2069377) (← links)
• The new spectral conjugate gradient method for large-scale unconstrained optimisation (Q2069403) (← links)
• A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
• On the inexact scaled gradient projection method (Q2070333) (← links)
• A method with inertial extrapolation step for convex constrained monotone equations (Q2072994) (← links)
• Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization (Q2073942) (← links)
• Levenberg-Marquardt method for absolute value equation associated with second-order cone (Q2074625) (← links)
• A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint (Q2075960) (← links)
• A new class of neural networks for NCPs using smooth perturbations of the natural residual function (Q2075986) (← links)
• A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
• Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
• Two improved nonlinear conjugate gradient methods with the strong Wolfe line search (Q2079812) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
• Projection method with inertial step for nonlinear equations: application to signal recovery (Q2083350) (← links)
• Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385) (← links)
• A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem (Q2084041) (← links)
• On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
• Computing the Lyapunov operator \(\varphi \)-functions, with an application to matrix-valued exponential integrators (Q2085670) (← links)
• Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems (Q2088792) (← links)
• A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration (Q2088825) (← links)
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
• A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
• Combined gradient methods for multiobjective optimization (Q2089219) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
• A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations (Q2089889) (← links)
• Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach (Q2090124) (← links)
• A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction (Q2091131) (← links)
• A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations (Q2098790) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems (Q2099954) (← links)
• Global convergence of Hager-Zhang type Riemannian conjugate gradient method (Q2101972) (← links)
• Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
• Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems (Q2103178) (← links)
• Two spectral conjugate gradient methods for unconstrained optimization problems (Q2103183) (← links)
• An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems (Q2104056) (← links)
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
• A common framework for modified regula falsi methods and new methods of this kind (Q2104373) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)