Pages that link to "Item:Q2500511"

The following pages link to Optimization theory and methods. Nonlinear programming (Q2500511):

Displaying 50 items.

• Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound (Q2084222) (← links)
• Efficient regularized Newton-type algorithm for solving convex optimization problem (Q2089188) (← links)
• A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction (Q2091131) (← links)
• Distributed reconstruction of time-varying graph signals via a modified Newton's method (Q2095020) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• An inexact ADMM with proximal-indefinite term and larger stepsize (Q2106244) (← links)
• Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
• Structured diagonal Gauss-Newton method for nonlinear least squares (Q2115053) (← links)
• Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing (Q2116059) (← links)
• A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints (Q2124795) (← links)
• Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application (Q2130906) (← links)
• Microbial community decision making models in batch and chemostat cultures (Q2142110) (← links)
• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems (Q2146720) (← links)
• Optimal scaling parameters for spectral conjugate gradient methods (Q2153393) (← links)
• A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints (Q2165796) (← links)
• The regularization continuation method with an adaptive time step control for linearly constrained optimization problems (Q2165865) (← links)
• Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model (Q2165892) (← links)
• A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
• Image restoration from noisy incomplete frequency data by alternative iteration scheme (Q2188154) (← links)
• A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations (Q2189341) (← links)
• A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
• A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
• A modified scaled memoryless symmetric rank-one method (Q2193423) (← links)
• Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT (Q2200304) (← links)
• Descent Perry conjugate gradient methods for systems of monotone nonlinear equations (Q2205641) (← links)
• A brief introduction to manifold optimization (Q2218094) (← links)
• A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
• A QSC method for fractional subdiffusion equations with fractional boundary conditions and its application in parameters identification (Q2221549) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• A modified ODE-based algorithm for unconstrained optimization problems (Q2248961) (← links)
• A nonmonotone trust region method based on simple quadratic models (Q2253065) (← links)
• A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
• Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization (Q2258098) (← links)
• Essential issues on solving optimal power flow problems using soft-computing (Q2260235) (← links)
• A brief survey of methods for solving nonlinear least-squares problems (Q2273095) (← links)
• A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations (Q2279636) (← links)
• A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem (Q2287031) (← links)
• A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs (Q2291279) (← links)
• Robust Schatten-\(p\) norm based approach for tensor completion (Q2291931) (← links)
• Convergence analyses on sparse feedforward neural networks via group lasso regularization (Q2292940) (← links)
• A heuristic approach to combat multicollinearity in least trimmed squares regression analysis (Q2295249) (← links)
• Numerical inversion of the fractional derivative index and surface thermal flux for an anomalous heat conduction model in a multi-layer medium (Q2295882) (← links)
• An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation (Q2297152) (← links)
• A stochastic trust region method for unconstrained optimization problems (Q2298821) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
• Numerical construction of spherical \(t\)-designs by Barzilai-Borwein method (Q2301296) (← links)
• Profit-based churn prediction based on minimax probability machines (Q2301965) (← links)
• A derivative-free algorithm for spherically constrained optimization (Q2307754) (← links)
• An improved nonmonotone adaptive trust region method. (Q2315468) (← links)