Pages that link to "Item:Q2940781"

The following pages link to Introduction to Nonlinear Optimization (Q2940781):

Displaying 44 items.

• Robust recovery of stream of pulses using convex optimization (Q294105) (← links)
• On Newton's method for the Fermat-Weber location problem (Q306303) (← links)
• Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure (Q721152) (← links)
• A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems (Q827565) (← links)
• Reducing effects of bad data using variance based joint sparsity recovery (Q1736886) (← links)
• An approach based on generalized Nash games and shared constraints for discrete time dynamic games (Q1741187) (← links)
• On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
• Conditional gradient method for multiobjective optimization (Q2028470) (← links)
• An operational test for the existence of a consistent increasing quasi-concave value function (Q2028813) (← links)
• Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
• The \(q\)-exponentials do not maximize the Rényi entropy (Q2070242) (← links)
• A piecewise conservative method for unconstrained convex optimization (Q2070340) (← links)
• A hybrid-line-and-curve search globalization technique for inexact Newton methods (Q2073945) (← links)
• Efficient assimilation of sparse data into RANS-based turbulent flow simulations using a discrete adjoint method (Q2088382) (← links)
• A new hybrid regularization scheme for removing salt and pepper noise (Q2140817) (← links)
• An analysis of dollar cost averaging and market timing investment strategies (Q2189909) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• A proximal gradient method for control problems with non-smooth and non-convex control cost (Q2231051) (← links)
• An iterative explicit algorithm for solving equilibrium problems in Banach spaces (Q2239041) (← links)
• Quantile regression under memory constraint (Q2284373) (← links)
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
• Multi-component multiphase porous flow (Q2297693) (← links)
• Optimal battery purchasing and charging strategy at electric vehicle battery swap stations (Q2312344) (← links)
• Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix (Q2317408) (← links)
• Quantile and expectile smoothing based on \(L_1\)-norm and \(L_2\)-norm fuzzy transforms (Q2329594) (← links)
• Optimization problems involving group sparsity terms (Q2330642) (← links)
• New results on the existence of open loop Nash equilibria in discrete time dynamic games via generalized Nash games (Q2417954) (← links)
• Numerical methods for the resource allocation problem in a computer network (Q2662812) (← links)
• Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
• Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
• Inexact gradient projection method with relative error tolerance (Q2696906) (← links)
• Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method (Q3389450) (← links)
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
• A Small Gain Analysis of Single Timescale Actor Critic (Q6042800) (← links)
• Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight (Q6043377) (← links)
• Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials (Q6102177) (← links)
• Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization (Q6126654) (← links)
• On the identification and optimization of nonsmooth superposition operators in semilinear elliptic PDEs (Q6151942) (← links)
• A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
• Nonmonotone globalization for Anderson acceleration via adaptive regularization (Q6159247) (← links)
• Global optimization using random embeddings (Q6160282) (← links)
• A variable projection method for the general radial basis function neural network (Q6160604) (← links)
• Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems (Q6165595) (← links)
• Constrained Monotone Mean-Variance Problem with Random Coefficients (Q6169625) (← links)