Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems (Q1756580) (← links)
- On inexact ADMMs with relative error criteria (Q1756581) (← links)
- Proximal primal-dual best approximation algorithm with memory (Q1756584) (← links)
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
- Error estimates for the approximation of multibang control problems (Q1756588) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- Computing eigenelements of real symmetric matrices via optimization (Q1771219) (← links)
- Convergence analysis of an inexact infeasible interior point method for semidefinite programming (Q1771220) (← links)
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization (Q1771221) (← links)
- A dual projective pivot algorithm for linear programming (Q1771222) (← links)
- A practical algorithm for computing a subadditive dual function for set partitioning (Q1771223) (← links)
- Computing the initial temperature of simulated annealing (Q1771224) (← links)
- Interval methods for semi-infinite programs (Q1773106) (← links)
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination (Q1773107) (← links)
- A variational discretization concept in control constrained optimization: The linear-quadratic case (Q1773108) (← links)
- On the multilevel structure of global optimization problems (Q1773109) (← links)
- A tabu search algorithm for the quadratic assignment problem (Q1773110) (← links)
- An iterative global optimization algorithm for potential energy minimization (Q1774569) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- Optimal production and marketing planning (Q1774575) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- Introduction to the special issue for SIMAI 2016 (Q1790665) (← links)
- A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization (Q1790670) (← links)
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming (Q1790671) (← links)
- Modified Fejér sequences and applications (Q1790672) (← links)
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications (Q1790676) (← links)
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm (Q1790679) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization (Q1790683) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- A non-overlapping DDM combined with the characteristic method for optimal control problems governed by convection-diffusion equations (Q1790685) (← links)
- Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- Automatic differentiation: Reduced gradient and reduced Hessian matrix (Q1803653) (← links)
- A Newton method for a class of quasi-variational inequalities (Q1804371) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- An efficient trust region method for unconstrained discrete-time optimal control problems (Q1804374) (← links)
- A computational study of several heuristics for the DRPP (Q1804375) (← links)
- Spherical minimax location problem using the Euclidean norm: Formulation and optimization (Q1804377) (← links)
- Polynomial auction algorithms for shortest paths (Q1804574) (← links)
- Global convergence of descent processes for solving non strictly monotone variational inequalities (Q1804576) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
- Analyzing infeasible nonlinear programs (Q1804579) (← links)
