Pages that link to "Item:Q174575"

The following pages link to Computational Optimization and Applications (Q174575):

Displaying 50 items.

• Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
• Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
• An SQP method for mathematical programs with vanishing constraints with strong convergence properties (Q2013146) (← links)
• \(L^1\) penalization of volumetric dose objectives in optimal control of PDEs (Q2013147) (← links)
• Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
• An explicit Tikhonov algorithm for nested variational inequalities (Q2023653) (← links)
• On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization (Q2023658) (← links)
• A variation of Broyden class methods using Householder adaptive transforms (Q2023660) (← links)
• The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
• Weak convergence of iterative methods for solving quasimonotone variational inequalities (Q2023662) (← links)
• On a numerical shape optimization approach for a class of free boundary problems (Q2023664) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
• Global optimization via inverse distance weighting and radial basis functions (Q2023666) (← links)
• Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation (Q2023669) (← links)
• Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation (Q2023682) (← links)
• Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
• A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← links)
• Convergence rates for an inexact ADMM applied to separable convex optimization (Q2023686) (← links)
• A proximal-point outer approximation algorithm (Q2023688) (← links)
• Riemannian conjugate gradient methods with inverse retraction (Q2023689) (← links)
• Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
• A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems (Q2023691) (← links)
• Expected residual minimization method for monotone stochastic tensor complementarity problem (Q2023693) (← links)
• On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
• An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
• Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems (Q2026765) (← links)
• Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms (Q2026767) (← links)
• Single-forward-step projective splitting: exploiting cocoercivity (Q2026768) (← links)
• Properties of the delayed weighted gradient method (Q2026769) (← links)
• Implementing and modifying Broyden class updates for large scale optimization (Q2026770) (← links)
• Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems (Q2026771) (← links)
• T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
• Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations (Q2026773) (← links)
• An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem (Q2026775) (← links)
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
• Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
• A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure (Q2028454) (← links)
• Quantitative results on a Halpern-type proximal point algorithm (Q2028456) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
• Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation (Q2028463) (← links)
• MINLP formulations for continuous piecewise linear function fitting (Q2028464) (← links)
• Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games (Q2028466) (← links)
• Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces (Q2028468) (← links)
• Conditional gradient method for multiobjective optimization (Q2028470) (← links)
• The Tikhonov regularization for vector equilibrium problems (Q2028472) (← links)
• Gauss-Newton-type methods for bilevel optimization (Q2028474) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)