The following pages link to SifDec (Q16274):
Displaying 50 items.
- A comparison of methods for traversing regions of non-convexity in optimization problems (Q2192582) (← links)
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
- An inexact and nonmonotone proximal method for smooth unconstrained minimization (Q2252253) (← links)
- Nonmonotone adaptive trust region method with line search based on new diagonal updating (Q2261939) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
- An improved nonmonotone adaptive trust region method. (Q2315468) (← links)
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
- A dense initialization for limited-memory quasi-Newton methods (Q2322555) (← links)
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization (Q2340982) (← links)
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization (Q2346397) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
- The optimization test environment (Q2357211) (← links)
- A nonmonotone inexact Newton method for unconstrained optimization (Q2359404) (← links)
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
- A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
- Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters (Q2389479) (← links)
- A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- On efficiently combining limited-memory and trust-region techniques (Q2398109) (← links)
- A frame-based conjugate gradients direct search method with radial basis function interpolation model (Q2398571) (← links)
- A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- A comparison of reduced and unreduced KKT systems arising from interior point methods (Q2401021) (← links)
- Spectral analysis of the preconditioned system for the \(3 \times 3\) block saddle point problem (Q2420149) (← links)
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties (Q2453184) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- Optimization theory and methods. Nonlinear programming (Q2500511) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
- New line search methods for unconstrained optimization (Q2510603) (← links)
- A feasible filter SQP algorithm with global and local convergence (Q2511102) (← links)
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
- On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064) (← links)
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
- Nonlinear analysis: optimization methods, convergence theory, and applications (Q2520483) (← links)
