Pages that link to "Item:Q174575"

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

Displaying 50 items.

• Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
• On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere (Q1938902) (← links)
• An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908) (← links)
• A new branch and bound method for a discrete truss topology design problem (Q1938912) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• An acceleration scheme for cyclic subgradient projections method (Q1938914) (← links)
• Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems (Q1938916) (← links)
• Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems (Q1938919) (← links)
• Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
• A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618) (← links)
• A cyclic projected gradient method (Q1946620) (← links)
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
• An ADM-based splitting method for separable convex programming (Q1946622) (← links)
• Linear convergence analysis of the use of gradient projection methods on total variation problems (Q1946623) (← links)
• Preconditioned iterative regularization in Banach spaces (Q1946624) (← links)
• An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography (Q1946625) (← links)
• A class of quasi-variational inequalities for adaptive image denoising and decomposition (Q1946626) (← links)
• A full second order variational model for multiscale texture analysis (Q1946628) (← links)
• Bregman operator splitting with variable stepsize for total variation image reconstruction (Q1946629) (← links)
• An exterior Newton method for strictly convex quadratic programming (Q1967119) (← links)
• Bregman proximal relaxation of large-scale 0-1 problems (Q1967121) (← links)
• Numerical experience with a reduced Hessian method for large scale constrained optimization (Q1967124) (← links)
• Optimization with variable sets of constraints and an application to truss design (Q1967125) (← links)
• A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging (Q1986101) (← links)
• A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103) (← links)
• Composite convex optimization with global and local inexact oracles (Q1986105) (← links)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
• Error estimates for the finite element approximation of bilinear boundary control problems (Q1986107) (← links)
• Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
• A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
• On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
• Additive and restricted additive Schwarz-Richardson methods for inequalities with nonlinear monotone operators (Q2007823) (← links)
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
• Minimizing the average searching time for an object within a graph (Q2007833) (← links)
• Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
• Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
• A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
• Error estimates for integral constraint regularization of state-constrained elliptic control problems (Q2012230) (← links)
• A Riemannian conjugate gradient method for optimization on the Stiefel manifold (Q2012231) (← links)
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
• Subspace-stabilized sequential quadratic programming (Q2012234) (← links)
• On merit functions for \(p\)-order cone complementarity problem (Q2012235) (← links)
• Analysis on Newton projection method for the split feasibility problem (Q2012236) (← links)
• Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks (Q2012240) (← links)
• Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization (Q2013139) (← links)
• Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions (Q2013141) (← links)