CUTE
From MaRDI portal
Publication:4371578
DOI10.1145/200979.201043zbMath0886.65058WikidataQ113310435 ScholiaQ113310435MaRDI QIDQ4371578
No author found.
Publication date: 26 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/56246
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C30: Nonlinear programming
Related Items
A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization, LOQO:an interior point code for quadratic programming, A repository of convex quadratic programming problems, SDPLIB 1.2, a library of semidefinite programming test problems, Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks, Solving mathematical programs with complementarity constraints as nonlinear programs, Affine conjugate adaptive Newton methods for nonlinear elastomechanics, Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, A nonmonotone semismooth inexact Newton method, Some descent three-term conjugate gradient methods and their global convergence, Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization, A Two-Term PRP-Based Descent Method, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, Interior point methods for large-scale nonlinear programming, CUTE, Local convergence of an inexact-restoration method and numerical experiments, A modified quasi-Newton method for structured optimization with partial information on the Hessian, Monotone projected gradient methods for large-scale box-constrained quadratic programming, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, An active set limited memory BFGS algorithm for large-scale bound constrained optimization, Augmented Lagrangian applied to convex quadratic problems, Simulated annealing with asymptotic convergence for nonlinear constrained optimization, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, A limited memory BFGS-type method for large-scale unconstrained optimization, A framework for globally convergent algorithms using gradient bounding functions, Corrected sequential linear programming for sparse minimax optimization, Recent progress in unconstrained nonlinear optimization without derivatives, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, Advances in design and implementation of optimization software, A starting point strategy for nonlinear interior methods., A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Nonmonotone strategy for minimization of quadratics with simple constraints., Nonmonotone curvilinear line search methods for unconstrained optimization, A numerical study of limited memory BFGS methods, Inertia-controlling factorizations for optimization algorithms, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Computational experience with penalty-barrier methods for nonlinear programming, Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search, Improving solver success in reaching feasibility for sets of nonlinear constraints, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization, On the method of shortest residuals for unconstrained optimization, Scaled conjugate gradient algorithms for unconstrained optimization, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, Self-adaptive inexact proximal point methods, A trust region method for optimization problem with singular solutions, Another hybrid conjugate gradient algorithm for unconstrained optimization, Nonconvex optimization using negative curvature within a modified linesearch, Two descent hybrid conjugate gradient methods for optimization, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Convergence of nonmonotone line search method, Mathematical programming models and algorithms for engineering design optimization, An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion, A subspace implementation of quasi-Newton trust region methods for unconstrained optimization, A new method of moving asymptotes for large-scale unconstrained optimization, A new family of conjugate gradient methods, A primal-dual interior-point algorithm for nonlinear least squares constrained problems, Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory, Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Computational experiments with scaled initial hessian approximation for the broyden family methods∗, A nonmonotone Broyden method for unconstrained optimization, On the performance of switching BFGS/SR1 algorithms for unconstrained optimization, Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization, A preconditioner for solving large-scale variational inequality problems by a semismooth inexact approach, A scaled nonlinear conjugate gradient algorithm for unconstrained optimization, Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
Uses Software
