Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
- The block-wise circumcentered-reflection method (Q2191785) (← links)
- Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
- An augmented Lagrangian method for quasi-equilibrium problems (Q2191787) (← links)
- Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
- A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification (Q2191793) (← links)
- Non-monotone inexact restoration method for nonlinear programming (Q2191795) (← links)
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
- A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
- A class of Benders decomposition methods for variational inequalities (Q2191798) (← links)
- A regularization method for constrained nonlinear least squares (Q2191800) (← links)
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems (Q2191802) (← links)
- Forward-reflected-backward method with variance reduction (Q2231039) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- Two new bidirectional search algorithms (Q2231042) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
- Strengthened splitting methods for computing resolvents (Q2231047) (← links)
- Newton-type methods near critical solutions of piecewise smooth nonlinear equations (Q2231048) (← links)
- The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems (Q2231049) (← links)
- A proximal gradient method for control problems with non-smooth and non-convex control cost (Q2231051) (← links)
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
- Cone-constrained eigenvalue problems: Theory and algorithms (Q2268921) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- OSiL: An instance language for optimization (Q2268923) (← links)
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane (Q2268924) (← links)
- Fast paths in large-scale dynamic road networks (Q2268926) (← links)
- Some projection-like methods for the generalized Nash equilibria (Q2268927) (← links)
- An algorithm for the estimation of a regression function by continuous piecewise linear functions (Q2268929) (← links)
- Special issue: Erice 2007 nonlinear optimization. Selected papers based on the presentations at the 5th workshop on new problems and innovative methods in nonlinear optimization, Rice, Italy, July 31--August 9, 2007 (Q2269192) (← links)
- Solution refinement at regular points of conic problems (Q2282811) (← links)
- Mesh adaptive direct search with simplicial Hessian update (Q2282812) (← links)
- Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints (Q2282813) (← links)
- Exact spectral-like gradient method for distributed optimization (Q2282815) (← links)
- A delayed weighted gradient method for strictly convex quadratic minimization (Q2282816) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants (Q2282819) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
- An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series (Q2282827) (← links)
- Correction to: ``The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications'' (Q2282828) (← links)
- Multiscale stochastic optimization: modeling aspects and scenario generation (Q2301125) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- A global hybrid derivative-free method for high-dimensional systems of nonlinear equations (Q2301130) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
