Pages that link to "Item:Q378113"
From MaRDI portal
The following pages link to Nonsmooth optimization via quasi-Newton methods (Q378113):
Displaying 50 items.
- Discrete optimal transport: complexity, geometry and applications (Q262303) (← links)
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- Composite proximal bundle method (Q359623) (← links)
- On optimal control of a sweeping process coupled with an ordinary differential equation (Q478761) (← links)
- Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Optimization of spectral functions of Dirichlet-Laplacian eigenvalues (Q602959) (← links)
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions (Q654068) (← links)
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Polynomial root radius optimization with affine constraints (Q1675252) (← links)
- SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model (Q1680972) (← links)
- AUV based source seeking with estimated gradients (Q1747015) (← links)
- The noncooperative transportation problem and linear generalized Nash games (Q1754116) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- On reduced input-output dynamic mode decomposition (Q1756919) (← links)
- Numerical investigation of Crouzeix's conjecture (Q2002781) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- Three-dimensional phase-field modeling of mode I + II/III failure in solids (Q2020852) (← links)
- Identifying behaviorally robust strategies for normal form games under varying forms of uncertainty (Q2028782) (← links)
- New results on superlinear convergence of classical quasi-Newton methods (Q2031938) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- A generalised phase field model for fatigue crack growth in elastic-plastic solids with an efficient monolithic solver (Q2060180) (← links)
- Local minimizers of the Crouzeix ratio: a nonsmooth optimization case study (Q2070327) (← links)
- Functional random effects modeling of brain shape and connectivity (Q2080727) (← links)
- A geometric integration approach to nonsmooth, nonconvex optimisation (Q2088134) (← links)
- Pseudospectral methods and iterative solvers for optimization problems from multiscale particle dynamics (Q2100558) (← links)
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) (← links)
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
- A greedy algorithm for optimal heating in powder-bed-based additive manufacturing (Q2138222) (← links)
- Limited-memory BFGS with displacement aggregation (Q2149548) (← links)
- Rates of superlinear convergence for classical quasi-Newton methods (Q2149549) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- Superlinear convergence of Broyden's method and BFGS algorithm using Kantorovich-type assumptions (Q2222152) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- Pseudo-feasible solutions in evolutionary bilevel optimization: test problems and performance assessment (Q2246047) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Design of delay-based output-feedback controllers optimizing a quadratic cost function via the delay Lyapunov matrix (Q2280820) (← links)
- A radial boundary intersection aided interior point method for multi-objective optimization (Q2282318) (← links)
- Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point (Q2287573) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- An algorithm for nonsmooth optimization by successive piecewise linearization (Q2316623) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering (Q2329774) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Nonsmoothness and a variable metric method (Q2346393) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
- Combining discrete and continuous optimization to solve kinodynamic motion planning problems (Q2358063) (← links)
- A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
