Pages that link to "Item:Q4017639"
From MaRDI portal
The following pages link to Minimization of Locally Lipschitzian Functions (Q4017639):
Displaying 28 items.
- A trust region algorithm for solving bilevel programming problems (Q385180) (← links)
- NE/SQP: A robust algorithm for the nonlinear complementarity problem (Q689133) (← links)
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- Optimization problems with equilibrium constraints and their numerical solution. (Q703216) (← links)
- Globalizing a nonsmooth Newton method via nonmonotone path search (Q953292) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Nonmonotone stabilization methods for nonlinear equations (Q1331105) (← links)
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)
- A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
- A trust region method for minimization of nonsmooth functions with linear constraints (Q1356054) (← links)
- On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
- Iteration functions in some nonsmooth optimization algorithms (Q1363553) (← links)
- A new descent algorithm for solving quadratic bilevel programming problems. (Q1582569) (← links)
- A numerical approach to optimization problems with variational inequality constraints (Q1804370) (← links)
- On an algorithm solving two-level programming problems with nonunique lower level solutions (Q1814990) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
- An SQP algorithm for extended linear-quadratic problems in stochastic programming (Q1896457) (← links)
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575) (← links)
- Local minimizers and rearrangements (Q2366976) (← links)
- A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization (Q2454987) (← links)
- Local minima, marginal functions, and separating hyperplanes in discrete optimization (Q2473013) (← links)
- Local minimizers of functionals with multiple volume constraints (Q3531528) (← links)
- A SIMPLE DERIVATION OF SUFFICIENT CONDITIONS FOR A LOCAL MINIMUM OF A LIPSCHITZIAN FUNCTION (Q4207799) (← links)
- (Q4714336) (← links)
- Computing optimal incentives via bilevel programming (Q4836754) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Multistage quadratic stochastic programming (Q5936073) (← links)
