The following pages link to (Q5588268):
Displaying 50 items.
- The Newton modified barrier method for QP problems (Q1915923) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- On regular coderivatives in parametric equilibria with non-unique multipliers (Q1925780) (← links)
- Global minimization of constrained problems with discontinuous penalty functions (Q1962979) (← links)
- Global optimum shape design (Q1962988) (← links)
- Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty (Q1969865) (← links)
- On the solution of linearly constrained optimization problems by means of barrier algorithms (Q1979175) (← links)
- An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- An objective penalty function method for biconvex programming (Q2052381) (← links)
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
- A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
- Interval-valued kriging for geostatistical mapping with imprecise inputs (Q2069049) (← links)
- Damped inertial dynamics with vanishing Tikhonov regularization: strong asymptotic convergence towards the minimum norm solution (Q2069167) (← links)
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications (Q2122022) (← links)
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
- Second-order optimality conditions for constrained optimization problems with \(C^1\) data via regular and limiting subdifferentials (Q2139251) (← links)
- Extra-optimal methods for solving ill-posed problems: survey of theory and examples (Q2207574) (← links)
- A primal-dual modified log-barrier method for inequality constrained nonlinear optimization (Q2228414) (← links)
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming (Q2230935) (← links)
- Differential equation method based on approximate augmented Lagrangian for nonlinear programming (Q2244211) (← links)
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\) (Q2264405) (← links)
- A combined penalty function and gradient projection method for nonlinear programming (Q2264722) (← links)
- A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems (Q2267414) (← links)
- Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
- Multiplier stabilization applied to two-stage stochastic programs (Q2275276) (← links)
- Sensitivity analysis for variational inequalities and nonlinear complementarity problems (Q2276887) (← links)
- Stability and sensitivity-analysis for stochastic programming (Q2277142) (← links)
- An approximate penalty method with descent for convex optimization problems (Q2286954) (← links)
- Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
- Using feedback functions in linear programming problems (Q2300706) (← links)
- New constraint qualifications with second-order properties in nonlinear optimization (Q2302753) (← links)
- Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization (Q2310126) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- Second order optimality conditions and their role in PDE control (Q2339273) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- First- and second-order necessary conditions via exact penalty functions (Q2349834) (← links)
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems (Q2350402) (← links)
- Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system (Q2369985) (← links)
- Parallelizable preprocessing method for multistage stochastic programming problems (Q2370063) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems (Q2371881) (← links)
- Two differential equation systems for inequality constrained optimization (Q2372013) (← links)
- New simple exact penalty function for constrained minimization (Q2376164) (← links)
- A stable differential equation approach for inequality constrained optimization problems (Q2379039) (← links)
