Pages that link to "Item:Q174575"

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

Displaying 50 items.

• On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
• Algebraic rules for quadratic regularization of Newton's method (Q2340522) (← links)
• On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems (Q2340523) (← links)
• A derivative-free descent method in set optimization (Q2340524) (← links)
• Limited memory BFGS method based on a high-order tensor model (Q2340525) (← links)
• Improved local convergence analysis of the Gauss-Newton method under a majorant condition (Q2340526) (← links)
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (Q2340528) (← links)
• Multiobjective swarm intelligence for the traffic grooming problem (Q2340529) (← links)
• Minimum penalty for constrained evolutionary optimization (Q2340530) (← links)
• Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
• A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems (Q2350863) (← links)
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers (Q2350866) (← links)
• Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations (Q2350867) (← links)
• A primal-dual interior point method for large-scale free material optimization (Q2350868) (← links)
• The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction (Q2350869) (← links)
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
• Terminating evolutionary algorithms at their steady state (Q2350874) (← links)
• Interval-based ranking in noisy evolutionary multi-objective optimization (Q2350876) (← links)
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
• Novel update techniques for the revised simplex method (Q2352418) (← links)
• Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
• Convergence analysis on a class of improved Chebyshev methods for nonlinear equations in Banach spaces (Q2352423) (← links)
• Symmetric error estimates for discontinuous Galerkin time-stepping schemes for optimal control problems constrained to evolutionary Stokes equations (Q2352424) (← links)
• Certified PDE-constrained parameter optimization using reduced basis surrogate models for evolution problems (Q2352426) (← links)
• Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
• Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
• Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
• Total variation image deblurring with space-varying kernel (Q2364126) (← links)
• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems (Q2364127) (← links)
• New subgradient extragradient methods for common solutions to equilibrium problems (Q2364128) (← links)
• Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces (Q2364129) (← links)
• Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
• Designing a majorization scheme for the recourse function in two-stage stochastic linear programming (Q2366830) (← links)
• Hierarchical sets in mathematical programming modeling languages (Q2366831) (← links)
• On handling indicator constraints in mixed integer programming (Q2374361) (← links)
• Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs? (Q2374362) (← links)
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
• Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method (Q2374367) (← links)
• A modified Levenberg-Marquardt method with line search for nonlinear equations (Q2374368) (← links)
• An adaptive gradient method for computing generalized tensor eigenpairs (Q2374369) (← links)
• Spherical optimization with complex variables for computing US-eigenpairs (Q2374370) (← links)
• An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)