On the superlinear convergence of a trust region algorithm for nonsmooth optimization
From MaRDI portal
Publication:3698656
DOI10.1007/BF02591949zbMATH Open0577.90066OpenAlexW1991976020MaRDI QIDQ3698656FDOQ3698656
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591949
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerically stable methods for quadratic programming
- A numerically stable dual method for solving strictly convex quadratic programs
- Newton-type methods for unconstrained and linearly constrained optimization
- A New Algorithm for Unconstrained Optimization
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A model algorithm for composite nondifferentiable optimization problems
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
Cited In (42)
- A trust region SQP algorithm for mixed-integer nonlinear programming
- A proximal method for composite minimization
- Title not available (Why is that?)
- A hybrid algorithm for nonlinear minimax problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- Value functions and error bounds of trust region methods
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method
- A trust region algorithm for nonsmooth optimization
- A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations
- Algorithms with adaptive smoothing for finite minimax problems
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- An inexact algorithm for composite nondifferentiable optimization
- Training multi-layered neural network with a trust-region based algorithm
- Superlinear convergence of a trust region type successive linear programming method
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
- A nonmonotonic hybrid algorithm for min-max problem
- A superlinearly convergent trust region algorithm for \(LC^1\) constrained optimization problems
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
- On the numerical treatment of nonconvex energy problems: Multilevel decomposition methods for hemivariational inequalities.
- Efficiency of minimizing compositions of convex functions and smooth maps
- Unification of basic and composite nondifferentiable optimization
- Two error bounds for constrained optimization problems and their applications
- A new filter method for solving nonlinear complementarity problems
- A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications
- A new trust region method for nonsmooth equations
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Trust-region interior-point method for large sparsel1optimization
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- A hybrid algorithm for linearly constrained minimax problems
- An active-set algorithm and a trust-region approach in constrained minimax problem
- Consistent approximations in composite optimization
- Recent advances in trust region algorithms
- Constructing composite search directions with parameters in quadratic interpolation models
- A smooth method for the finite minimax problem
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- Relax-and-split method for nonconvex inverse problems
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Nonmonotone algorithm for minimax optimization problems
- A feasible trust-region algorithm for inequality constrained optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
This page was built for publication: On the superlinear convergence of a trust region algorithm for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698656)