The following pages link to (Q5588268):
Displaying 50 items.
- Computing Maximum Likelihood Estimators of Convex Density Functions (Q4389265) (← links)
- A numerical study of multiplier methods for constrained parameter optimization (Q4401235) (← links)
- Sensitivity Analysis for Mirror-Stratifiable Convex Functions (Q4554065) (← links)
- Fluorescence molecular imaging based on the adjoint radiative transport equation (Q4571013) (← links)
- Generalized Sensitivity Analysis of Nonlinear Programs (Q4603041) (← links)
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs (Q4634162) (← links)
- Continuous relaxations for Constrained Maximum-Entropy Sampling (Q4645926) (← links)
- A two parameter mixed interior-exterior penalty algorithm (Q4698118) (← links)
- Lipschitz programming via increasing convex-along-rays functions<sup>*</sup> (Q4700278) (← links)
- Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems (Q4721882) (← links)
- Optimization of large-scale complex systems (Q4723614) (← links)
- Necessary and sufficient conditions for quadratic minimality (Q4745640) (← links)
- Penalty functions in ε-programming and ε-minimax problems (Q4750425) (← links)
- On the symmetric affiine scaling algorithm for line programming<sup>*</sup> (Q4764582) (← links)
- Sensitivity analysis for constraint and variational systems by means of set-valued differentiation (Q4764593) (← links)
- A dual approach to solving nonlinear programming problems by unconstrained optimization (Q4767127) (← links)
- MONOPOLISTIC EOUILIBRIUM, COMPROMISE BENEFIT AND THE THEORY OF THE SECOND BEST(*) (Q4770169) (← links)
- Computational experience in sensitivity analysis for nonlinear programming (Q4770792) (← links)
- On the convergence of SUMT (Q4772980) (← links)
- A numerical study of multiplier methods for constrained parameter optimization (Q4772987) (← links)
- A column generation algorithm for nonlinear programming (Q4777075) (← links)
- A general non-linear optimization algorithm for lower bound limit analysis (Q4808420) (← links)
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions (Q4859453) (← links)
- Comparison principles applied to obstacle problems with penalties (Q4883626) (← links)
- Computation of the distance to semi-algebraic sets (Q4941311) (← links)
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
- Entropy binomial tree method and calibration for the volatility smile (Q4991538) (← links)
- Decentralized multi-agent optimization based on a penalty method (Q5055302) (← links)
- ON THE RELATION BETWEEN TWO APPROACHES TO EXTERIOR PENALTY METHOD FOR CONSTRAINED OPTIMAL CONTROL PROBLEMS (Q5067397) (← links)
- Hybrid differential evolutionary strawberry algorithm for real-parameter optimization problems (Q5078478) (← links)
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games (Q5087713) (← links)
- (Q5091983) (← links)
- Incorporating knowledge on the measurement noise in electrical impedance tomography (Q5107990) (← links)
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme (Q5122280) (← links)
- Linear programming twin support vector regression (Q5155904) (← links)
- On global quadratic growth condition for min-max optimization problems with quadratic functions (Q5175334) (← links)
- Contributions to the theory of stochastic programming (Q5181085) (← links)
- A Quasi-Newton Method with No Derivatives (Q5181093) (← links)
- Computable error bounds for nonlinear programming (Q5183288) (← links)
- Extending the Pennisi--McCormick Second-Order Sufficiency Theory for Nonlinear Programming to Infinite Dimensions (Q5231689) (← links)
- On the Sensitivity of Least Squares Data Fitting by Nonnegative Second Divided Differences (Q5270507) (← links)
- Linear programming with entropic perturbation (Q5286755) (← links)
- Global Dynamical Solvers for Nonlinear Programming Problems (Q5346496) (← links)
- Optimization-based approach to path planning for closed chain robot systems (Q5403422) (← links)
- An example of an ill-conditioned nlp problem (Q5626435) (← links)
- Recent advances in unconstrained optimization (Q5636700) (← links)
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems (Q5653813) (← links)
- Explicit solution of an optimization problem (Q5653815) (← links)
- A language for nonlinear programming problems (Q5653824) (← links)
- An efficient algorithm for minimizing barrier and penalty functions (Q5661720) (← links)
