Pages that link to "Item:Q3788978"
From MaRDI portal
The following pages link to Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978):
Displaying 50 items.
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- Trust region algorithm with two subproblems for bound constrained problems (Q279647) (← links)
- A new direct search method based on separable fractional interpolation model (Q287849) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Parallel Uzawa method for large-scale minimization of partially separable functions (Q368609) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Study of multiscale global optimization based on parameter space partition (Q620530) (← links)
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications (Q715072) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Parallel quasi-Newton methods for unconstrained optimization (Q1116897) (← links)
- Convergence of quasi-Newton matrices generated by the symmetric rank one update (Q1176575) (← links)
- Variationally derived scaling and variable metric updates from the preconvex part of the Broyden family (Q1321183) (← links)
- Generalized Polak-Ribière algorithm (Q1321261) (← links)
- Representations of quasi-Newton matrices and their use in limited memory methods (Q1322551) (← links)
- A new trust region algorithm for bound constrained minimization (Q1337095) (← links)
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- A trust-region strategy for minimization on arbitrary domains (Q1890927) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Scaled projected-directions methods with application to transmission tomography (Q2218907) (← links)
- An efficient implementation of a trust region method for box constrained optimization (Q2346512) (← links)
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints (Q2385544) (← links)
- Global convergence and the Powell singular function (Q2392109) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties (Q2453184) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- (Q3203937) (← links)
- Training multi-layered neural network with a trust-region based algorithm (Q3489808) (← links)
- (Q4039213) (← links)
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization (Q4372656) (← links)
- Approximate norm descent methods for constrained nonlinear systems (Q4605702) (← links)
- An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization (Q5028601) (← links)
