Pages that link to "Item:Q3698656"
From MaRDI portal
The following pages link to On the superlinear convergence of a trust region algorithm for nonsmooth optimization (Q3698656):
Displaying 38 items.
- A proximal method for composite minimization (Q304260) (← links)
- A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
- Constructing composite search directions with parameters in quadratic interpolation models (Q652677) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- A new filter method for solving nonlinear complementarity problems (Q870225) (← links)
- Two error bounds for constrained optimization problems and their applications (Q1021250) (← links)
- A trust region algorithm for nonsmooth optimization (Q1341571) (← links)
- On the numerical treatment of nonconvex energy problems: Multilevel decomposition methods for hemivariational inequalities. (Q1578624) (← links)
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions (Q1772966) (← links)
- An inexact algorithm for composite nondifferentiable optimization (Q1823153) (← links)
- Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
- An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
- Value functions and error bounds of trust region methods (Q2454979) (← links)
- A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
- A feasible trust-region algorithm for inequality constrained optimization (Q2489190) (← links)
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
- Training multi-layered neural network with a trust-region based algorithm (Q3489808) (← links)
- A new trust region method for nonsmooth equations (Q4430644) (← links)
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
- A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
- Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
- Trust-region interior-point method for large sparse<i>l</i><sub>1</sub>optimization (Q5437524) (← links)
- A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
- Consistent approximations in composite optimization (Q6165588) (← links)
