The following pages link to PLCP (Q16957):
Displaying 50 items.
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- A quantum genetic algorithm for optimization problems on the Bloch sphere (Q2102252) (← links)
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
- Multi-phase algorithm design for accurate and efficient model fitting (Q2115821) (← links)
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (Q2117635) (← links)
- A primal-dual algorithm for risk minimization (Q2133418) (← links)
- Physics constrained learning for data-driven inverse modeling from sparse observations (Q2135255) (← links)
- Nonlinear optimization of district heating networks (Q2139138) (← links)
- Optimal control of nonlinear fractional-order systems with multiple time-varying delays (Q2139285) (← links)
- A sliding window algorithm for energy distribution system with storage (Q2142782) (← links)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
- A gradient-type algorithm for constrained optimization with application to microstructure optimization (Q2175676) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- Topology optimization design of stretchable metamaterials with Bézier skeleton explicit density (BSED) representation algorithm (Q2184482) (← links)
- A class of Benders decomposition methods for variational inequalities (Q2191798) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Superlinear convergence of the sequential quadratic method in constrained optimization (Q2198525) (← links)
- A proximal interior point algorithm with applications to image processing (Q2203368) (← links)
- Properties of the sign gradient descent algorithms (Q2214992) (← links)
- Automating the design of tokamak experiment scenarios (Q2222311) (← links)
- Synchronisation and control of proliferation in cycling cell population models with age structure (Q2229783) (← links)
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming (Q2230935) (← links)
- Optimization algorithms for parameter identification in parabolic partial differential equations (Q2244961) (← links)
- Fully smoothed \(\ell_1\)-\(TV\) models: bounds for the minimizers and parameter choice (Q2251224) (← links)
- Newton-type methods: a broader view (Q2260691) (← links)
- Robust static super-replication of barrier options (Q2272291) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Multiplier stabilization applied to two-stage stochastic programs (Q2275276) (← links)
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
- Constrained optimization based F. E. mesh deforming algorithm for unconfined seepage problems (Q2292386) (← links)
- Heat and electricity market coordination: a scalable complementarity approach (Q2294652) (← links)
- A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity (Q2310425) (← links)
- Analytical expression of elastic rods at equilibrium under 3D strong anchoring boundary conditions (Q2311656) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram (Q2321881) (← links)
- HLRF-BFGS optimization algorithm for structural reliability (Q2338448) (← links)
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- Optimization of the complex-RFM optimization algorithm (Q2357841) (← links)
- Inverse truss design as a conic mathematical program with equilibrium constraints (Q2360462) (← links)
- Finding the optimal opening time of harvesting farmed fishery resources (Q2364729) (← links)
- Optimal design of experiments via linear programming (Q2374424) (← links)
- Axioms and variational problems in surface parameterization (Q2388591) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions (Q2397004) (← links)
- A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
