Pages that link to "Item:Q174575"

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

Displaying 50 items.

• A new strategy for the undirected two-commodity maximum flow problem (Q711380) (← links)
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
• An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
• Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
• Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
• Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling (Q711389) (← links)
• Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
• An iterative approach for cone complementarity problems for nonsmooth dynamics (Q711391) (← links)
• Special issue: Erice 2010 nonlinear optimization. Selected papers based on the presentations at the 6th workshop on nonlinear optimization, variational inequalities and equilibrium problems, Erice, Italy, July 2--10, 2010 (Q715156) (← links)
• Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
• Optimal control of a class of reaction-diffusion systems (Q721949) (← links)
• Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
• A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
• Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
• A class of ADMM-based algorithms for three-block separable convex programming (Q721954) (← links)
• The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
• A convergent relaxation of the Douglas-Rachford algorithm (Q721957) (← links)
• On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
• Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
• A class of problems for which cyclic relaxation converges linearly (Q732240) (← links)
• Radar placement based on a geometric uncertainty multiplier reduction criterion (Q732241) (← links)
• Convergence rates for direct transcription of optimal control problems using collocation at Radau points (Q732243) (← links)
• A control reduced primal interior point method for a class of control constrained optimal control problems (Q732245) (← links)
• A Levenberg-Marquardt method with approximate projections (Q742291) (← links)
• Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization (Q742293) (← links)
• A new error bound result for generalized Nash equilibrium problems and its algorithmic application (Q742294) (← links)
• Non-cooperative games with minmax objectives (Q742296) (← links)
• On an enumerative algorithm for solving eigenvalue complementarity problems (Q742298) (← links)
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
• An affine scaling method for optimization problems with polyhedral constraints (Q742300) (← links)
• Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
• On error bounds and Newton-type methods for generalized Nash equilibrium problems (Q742304) (← links)
• Approximation methods for complex polynomial optimization (Q742305) (← links)
• Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints (Q742306) (← links)
• A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
• Optimal parameter selection for nonlinear multistage systems with time-delays (Q742308) (← links)
• Space tensor conic programming (Q742309) (← links)
• A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
• A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
• Computation of generalized differentials in nonlinear complementarity problems (Q763389) (← links)
• A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds (Q763390) (← links)
• Pricing American options with uncertain volatility through stochastic linear complementarity models (Q763392) (← links)
• An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← links)
• Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
• The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions (Q763397) (← links)
• Network capacity management under competition (Q763398) (← links)