Nonmonotone conic trust region method with line search technique for bound constrained optimization

DOI10.1051/ro/2017054zbMath1461.65192OpenAlexW2726063369MaRDI QIDQ5242265

Lijuan Zhao

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017054

zbMATH Keywords

line searchconic modeltrust regionnonmonotone techniquebound constrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Uses Software

• STRSCNE
• CoDoSol

Cites Work

• Unnamed Item
• Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
• An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization
• An affine scaling method for optimization problems with polyhedral constraints
• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
• Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions
• Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
• An affine-scaling interior-point CBB method for box-constrained optimization
• Test examples for nonlinear programming codes
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
• Nonmonotone adaptive trust-region method for unconstrained optimization problems
• An iterative algorithm for the conic trust region subproblem
• An affine scaling trust-region approach to bound-constrained nonlinear systems
• Nonmonotone trust region method for solving optimization problems
• Constrained dogleg methods for nonlinear systems with simple bounds
• A trust region affine scaling method for bound constrained optimization
• Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
• Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
• Optimization theory and methods. Nonlinear programming
• An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems
• Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations
• A new nonmonotone trust-region method of conic model for solving unconstrained optimization
• A CONIC AFFINE SCALING DOGLEG METHOD FOR NONLINEAR OPTIMIZATION WITH BOUND CONSTRAINTS
• On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems
• A trust-region method with a conic model for unconstrained optimization
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Conic Approximations and Collinear Scalings for Optimizers
• The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
• Numerical Optimization
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
• Benchmarking optimization software with performance profiles.

This page was built for publication: Nonmonotone conic trust region method with line search technique for bound constrained optimization