Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems (Q1588843) (← links)
- On the behavior of the gradient norm in the steepest descent method (Q1610310) (← links)
- A Frank--Wolfe type theorem for convex polynomial programs (Q1610311) (← links)
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation (Q1610312) (← links)
- A globally convergent smoothing Newton method for nonsmooth equations and its application to complementarity problems (Q1610314) (← links)
- Modified two-point stepsize gradient methods for unconstrained optimization (Q1610315) (← links)
- Parallel variable distribution for constrained optimization (Q1610316) (← links)
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search (Q1610317) (← links)
- Regularization of \(L^\infty\)-optimal control problems for distributed parameter systems (Q1610318) (← links)
- Primal-dual strategy for state-constrained optimal control problems (Q1610319) (← links)
- Fast iterative solution of saddle point problems in optimal control based on wavelets (Q1610320) (← links)
- Robust optimal service analysis of single-server re-entrant queues (Q1610321) (← links)
- A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
- Duality of nonconvex optimization with positively homogeneous functions (Q1616938) (← links)
- Exact augmented Lagrangian functions for nonlinear semidefinite programming (Q1616939) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems (Q1639709) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis (Q1639712) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints (Q1639715) (← links)
- Chance-constrained economic dispatch with renewable energy and storage (Q1639716) (← links)
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (Q1639718) (← links)
- Adaptive optimal control of Signorini's problem (Q1639720) (← links)
- Efficiently solving total least squares with Tikhonov identical regularization (Q1639723) (← links)
- A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions (Q1639725) (← links)
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
- On the control of time discretized dynamic contact problems (Q1687312) (← links)
- Mitigating the curse of dimensionality: sparse grid characteristics method for optimal feedback control and HJB equations (Q1687313) (← links)
- Descent algorithm for nonsmooth stochastic multiobjective optimization (Q1687314) (← links)
- An alternating direction and projection algorithm for structure-enforced matrix factorization (Q1687315) (← links)
- Approximate ADMM algorithms derived from Lagrangian splitting (Q1687316) (← links)
- Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318) (← links)
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery (Q1687319) (← links)
- On the convergence of alternating minimization methods in variational PGD (Q1687320) (← links)
- Using negative curvature in solving nonlinear programs (Q1694388) (← links)
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming (Q1694389) (← links)
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems (Q1694391) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- Inexact proximal stochastic gradient method for convex composite optimization (Q1694394) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
