Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
- Modified Jacobian smoothing method for nonsmooth complementarity problems (Q2301134) (← links)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
- Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance (Q2301137) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Optimally linearizing the alternating direction method of multipliers for convex programming (Q2301139) (← links)
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms (Q2301141) (← links)
- A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities (Q2301142) (← links)
- Secant update version of quasi-Newton PSB with weighted multisecant equations (Q2301143) (← links)
- A line search exact penalty method for nonlinear semidefinite programming (Q2301144) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Fast feasibility check of the multi-material vertical alignment problem in road design (Q2301147) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
- Preface to the special issue on optimization with polynomials and tensors (Q2307700) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
- A semidefinite relaxation method for second-order cone polynomial complementarity problems (Q2307702) (← links)
- Stochastic structured tensors to stochastic complementarity problems (Q2307703) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors (Q2307705) (← links)
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706) (← links)
- Tensor neural network models for tensor singular value decompositions (Q2307707) (← links)
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement (Q2307708) (← links)
- Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence (Q2322553) (← links)
- Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
- A dense initialization for limited-memory quasi-Newton methods (Q2322555) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- A subspace SQP method for equality constrained optimization (Q2322557) (← links)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint (Q2322558) (← links)
- A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs (Q2322559) (← links)
- Bounds for integration matrices that arise in Gauss and Radau collocation (Q2322561) (← links)
- Convergence rate for a Radau hp collocation method applied to constrained optimal control (Q2322562) (← links)
- Correction to: ``Convergence rate for a Radau hp collocation method applied to constrained optimal control'' (Q2322563) (← links)
- Linear equalities in blackbox optimization (Q2340487) (← links)
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
- Reconstruction algorithm for unknown cavities via Feynman-Kac type formula (Q2340492) (← links)
- Legendre-Galerkin spectral methods for optimal control problems with integral constraint for state in one dimension (Q2340493) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- A new algorithm for the minimum spanning tree verification problem (Q2340495) (← links)
- On heuristic bi-criterion methods for semi-obnoxious facility location (Q2340496) (← links)
- An incremental clustering algorithm based on hyperbolic smoothing (Q2340498) (← links)
- Differential evolution using a superior-inferior crossover scheme (Q2340500) (← links)
