Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers (Q2057229) (← links)
- Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids (Q2057230) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- A Riemannian rank-adaptive method for low-rank matrix completion (Q2070331) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- On \(R\)-linear convergence analysis for a class of gradient methods (Q2070335) (← links)
- Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
- Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse (Q2070338) (← links)
- A piecewise conservative method for unconstrained convex optimization (Q2070340) (← links)
- Finding best approximation pairs for two intersections of closed convex sets (Q2070342) (← links)
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem (Q2070343) (← links)
- Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations (Q2082542) (← links)
- Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
- Efficient scalarization in multiobjective optimal control of a nonsmooth PDE (Q2082545) (← links)
- Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces (Q2082546) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- A generalized shortest path tour problem with time windows (Q2082551) (← links)
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\) (Q2082553) (← links)
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- Special issue for SIMAI 2020-2021: large-scale optimization and applications (Q2111463) (← links)
- Cartoon-texture evolution for two-region image segmentation (Q2111464) (← links)
- A random time-dependent noncooperative equilibrium problem (Q2111465) (← links)
- A stochastic first-order trust-region method with inexact restoration for finite-sum minimization (Q2111466) (← links)
- A nested primal-dual FISTA-like scheme for composite convex optimization problems (Q2111467) (← links)
- Constrained and unconstrained deep image prior optimization models with automatic regularization (Q2111471) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations (Q2111473) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- From inexact optimization to learning via gradient concentration (Q2111477) (← links)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method (Q2114817) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- An inexact accelerated stochastic ADMM for separable convex optimization (Q2114819) (← links)
- A smoothing proximal gradient algorithm for matrix rank minimization problem (Q2114821) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Iterative regularization for constrained minimization formulations of nonlinear inverse problems (Q2114823) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients (Q2114826) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
- Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems (Q2114830) (← links)
- Clustering-based multipopulation approaches in MOEA/D for many-objective problems (Q2114832) (← links)
- Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
